THE COMPLEXITY OF GRAPH CONNECTIVITY

被引：0
|
作者：
WIGDERSON, A [1 ]
机构：
[1] PRINCETON UNIV, PRINCETON, NJ 08544 USA
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 629卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging open problems.
引用
收藏
页码：112 / 132
页数：21
相关论文
共 50 条
  • [31] THE COMPLEXITY OF SEARCHING A GRAPH
    MEGIDDO, N
    HAKIMI, SL
    GAREY, MR
    JOHNSON, DS
    PAPADIMITRIOU, CH
    JOURNAL OF THE ACM, 1988, 35 (01) : 18 - 44
  • [32] ON THE COMPLEXITY OF GRAPH MANIFOLDS
    Fominykh, E.
    Ovchinnikov, M.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 190 - 191
  • [33] Spectral Graph Complexity
    Tsitsulin, Anton
    Mottin, Davide
    Karras, Panagiotis
    Bronstein, Alex
    Mueller, Emmanuel
    COMPANION OF THE WORLD WIDE WEB CONFERENCE (WWW 2019 ), 2019, : 308 - 309
  • [34] ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
    KRATSCH, D
    HEMASPAANDRA, LA
    MATHEMATICAL SYSTEMS THEORY, 1994, 27 (03): : 257 - 273
  • [35] THE COMPLEXITY OF PURSUIT ON A GRAPH
    GOLDSTEIN, AS
    REINGOLD, EM
    THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 93 - 112
  • [36] The linear complexity of a graph
    Neel, DL
    Orrison, ME
    ELECTRONIC JOURNAL OF COMBINATORICS, 2006, 13 (01):
  • [37] Complexity of pursuit on a graph
    Goldstein, A.S.
    Reingold, E.M.
    Theoretical Computer Science, 1995, 143 (01):
  • [38] The Complexity of Growing a Graph
    Mertzios, George B.
    Michail, Othon
    Skretas, George
    Spirakis, Paul G.
    Theofilatos, Michail
    ALGORITHMICS OF WIRELESS NETWORKS, ALGOSENSORS 2022, 2022, 13707 : 123 - 137
  • [39] ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
    KRATSCH, D
    HEMACHANDRA, LA
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 318 - 328
  • [40] Remarks on graph complexity
    Lokam, SV
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 307 - 318
12345