메뉴 건너뛰기




Volumn 2380 LNCS, Issue , 2002, Pages 985-992

Finding a path of superlogarithmic length

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 1842539952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_84     Document Type: Conference Paper
Times cited : (3)

References (9)
  • 2
    • 43949173357 scopus 로고
    • On linear time minor tests with depth-first search
    • H.L.Bo dlaender.On linear time minor tests with depth-first search. Journal of Algorithms, 14(1):1-23, 1993.
    • (1993) Journal of Algorithms , vol.14 , Issue.1 , pp. 1-23
    • Bodlaender, H.L.1
  • 3
    • 0009762236 scopus 로고
    • Relativ e length of paths and cycles in 3-connected graphs
    • J.A.Bondy and S.C.Lo cke.Relativ e length of paths and cycles in 3-connected graphs. Discrete Mathematics, 33:111-122, 1981.
    • (1981) Discrete Mathematics , vol.33 , pp. 111-122
    • Bondy, J.A.1    Locke, S.C.2
  • 4
    • 0033692212 scopus 로고    scopus 로고
    • Finding long paths and cycles in sparse Hamiltonian graphs
    • ACM
    • T.F eder, R.Mot wani, and C.S.Subi.Finding long paths and cycles in sparse Hamiltonian graphs.In Proc. 32th STOC, pages 524-529.A CM, 2000.
    • (2000) Proc. 32th STOC , pp. 524-529
    • Feder, T.1    Motwani, R.2    Subi, C.S.3
  • 6
    • 0001867234 scopus 로고    scopus 로고
    • On approximating the longest path in a graph
    • D.Karger, R.Mot wani, and G.D.S.Ramkumar.On approximating the longest path in a graph. Algorithmica, 18(1):82-98, 1997.
    • (1997) Algorithmica , vol.18 , Issue.1 , pp. 82-98
    • Karger, D.1    Motwani, R.2    Ramkumar, G.D.S.3
  • 7
    • 0011228683 scopus 로고
    • How to find long paths efficiently
    • B.Monien.Ho w to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.
    • (1985) Annals of Discrete Mathematics , vol.25 , pp. 239-254
    • Monien, B.1
  • 9
    • 0033894524 scopus 로고    scopus 로고
    • An approximation algorithm for finding a long path in Hamiltonian graphs
    • S.Vish wanathan.An approximation algorithm for finding a long path in Hamiltonian graphs.In Proc. 11th SODA, pages 680-685, 2000.
    • (2000) Proc. 11th SODA , pp. 680-685
    • Vishwanathan, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.