REACHABILITY IS HARDER FOR DIRECTED THAN FOR UNDIRECTED FINITE GRAPHS

被引:66
|
作者
AJTAI, M
FAGIN, R
机构
关键词
D O I
10.2307/2274958
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:113 / 150
页数:38
相关论文
共 50 条
  • [1] The Decision Problem for Undirected Graphs with Reachability and Acyclicity
    Cantone, Domenico
    De Domenico, Andrea
    Maugeri, Pietro
    [J]. TWENTY YEARS OF THEORETICAL AND PRACTICAL SYNERGIES, CIE 2024, 2024, 14773 : 431 - 446
  • [2] EMBEDDING GRAPHS IN UNDIRECTED AND DIRECTED CUBES
    HAVEL, I
    [J]. LECTURE NOTES IN MATHEMATICS, 1983, 1018 : 60 - 68
  • [3] PARTITIONS AND HOMOMORPHISMS IN DIRECTED AND UNDIRECTED GRAPHS
    EVERETT, M
    NIEMINEN, J
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 1980, 7 (01): : 91 - 111
  • [4] Proximity and remoteness in directed and undirected graphs
    Ai, Jiangdong
    Gerke, Stefanie
    Gutin, Gregory
    Mafunda, Sonwabile
    [J]. DISCRETE MATHEMATICS, 2021, 344 (03)
  • [5] Cover coding for reachability on directed graphs
    Koo, Z
    [J]. IKE '05: Proceedings of the 2005 International Conference on Information and Knowledge Engineering, 2005, : 222 - 228
  • [6] Reachability Oracles for Directed Transmission Graphs
    Haim Kaplan
    Wolfgang Mulzer
    Liam Roditty
    Paul Seiferth
    [J]. Algorithmica, 2020, 82 : 1259 - 1276
  • [7] Reachability Oracles for Directed Transmission Graphs
    Kaplan, Haim
    Mulzer, Wolfgang
    Roditty, Liam
    Seiferth, Paul
    [J]. ALGORITHMICA, 2020, 82 (05) : 1259 - 1276
  • [8] Fault Tolerant Reachability for Directed Graphs
    Baswana, Surender
    Choudhary, Keerti
    Roditty, Liam
    [J]. DISTRIBUTED COMPUTING (DISC 2015), 2015, 9363 : 528 - 543
  • [9] Finite automata with undirected state graphs
    Martin Kutrib
    Andreas Malcher
    Christian Schneider
    [J]. Acta Informatica, 2022, 59 : 163 - 181
  • [10] Generalized Spectral Clustering for Directed and Undirected Graphs
    Sevi, Harry
    Jonckeere, Matthieu
    Kalogeratos, Argyris
    [J]. arXiv, 2022,