Algorithms for Searching Paths in Huge Graphs

被引：0

作者：

Polyakov I.V. ^{[1
]}

Chepovskiy A.A. ^{[1
]}

Chepovskiy A.M. ^{[1
]}

机构：

[1] National Research University “The Higher School of Economics,”, Moscow

来源：

Journal of Mathematical Sciences | 2015年 / 211卷 / 3期

关键词：

Short Path; Short Path Problem; Adjacency List; Dijkstra Algorithm; Graph Link;

D O I：

10.1007/s10958-015-2612-1

中图分类号：

学科分类号：

摘要：

引用

页码：413 / 417

页数：4

共 50 条

[1] ALGORITHMS FOR SEARCHING MASSIVE GRAPHS
AGRAWAL, R
JAGADISH, HV
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1994, 6 (02) : 225 - 238
[2] Algorithms for long paths in graphs
Zhang, Zhao
Li, Hao
THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 25 - 34
[3] Comparing performance of graph matching algorithms on huge graphs
Carletti, Vincenzo
Foggia, Pasquale
Greco, Antonio
Saggese, Alessia
Vento, Mario
PATTERN RECOGNITION LETTERS, 2020, 134 : 58 - 67
[4] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
FEUERSTEIN, E
MARCHETTISPACCAMELA, A
THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 359 - 371
[5] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
FEUERSTEIN, E
MARCHETTISPACCAMELA, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 187 - 197
[6] Evolutionary Algorithms for Searching Almost-Equienergetic Graphs
Jimenez-Aparicio, Aaron
Mezura-Montes, Efren
Acosta-Mesa, Hector-Gabriel
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1093 - 1098
[7] FAST ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS, WITH APPLICATIONS
FREDERICKSON, GN
SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1004 - 1022
[8] NONBLOCKING GRAPHS - GREEDY ALGORITHMS TO COMPUTE DISJOINT PATHS
SCHWILL, A
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 415 : 250 - 262
[9] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
PANTZIOU, GE
SPIRAKIS, PG
ZAROLIAGIS, CD
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 288 - 300
[10] Improved algorithms for replacement paths problems in restricted graphs
Bhosle, AM
OPERATIONS RESEARCH LETTERS, 2005, 33 (05) : 459 - 466

← 1 2 3 4 5 →