메뉴 건너뛰기




Volumn 3341, Issue , 2004, Pages 871-883

Efficient algorithms for the longest path problem

Author keywords

Efficient algorithms; Graph classes; Longest path problem

Indexed keywords

CLUSTERING ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

EID: 35048827876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_74     Document Type: Article
Times cited : (70)

References (26)
  • 1
    • 84976775257 scopus 로고
    • Color-Coding. J
    • N. Alon, R. Yuster, and U. Zwick. Color-Coding. J. ACM, 42(4): 844-856, 1995.
    • (1995) ACM , vol.42 , Issue.4 , pp. 844-856
    • Alon, N.1    Yuster, R.2    Zwick, U.3
  • 5
    • 0020806803 scopus 로고
    • Finding Hamiltonian Circuits in Proper Interval Graphs
    • A. A. Bertossi. Finding Hamiltonian Circuits in Proper Interval Graphs. Info. Proc. Lett. , 17(2): 97-101, 1983.
    • (1983) Info. Proc. Lett. , vol.17 , Issue.2 , pp. 97-101
    • Bertossi, A.A.1
  • 6
    • 0023045041 scopus 로고
    • Hamiltonian Circuits in Interval Graph Generalizations
    • A. A. Bertossi and M. A. Bonuccelli. Hamiltonian Circuits in Interval Graph Generalizations. Info. Proc. Lett. , 23: 195-200, 1986.
    • (1986) Info. Proc. Lett. , vol.23 , pp. 195-200
    • Bertossi, A.A.1    Bonuccelli, M.A.2
  • 7
    • 0942288266 scopus 로고    scopus 로고
    • Finding a Path of Superlogarithmic Length
    • A. Björklund and T. Husfeldt. Finding a Path of Superlogarithmic Length. SIAM J. Comput. , 32(6): 1395-1402, 2003.
    • (2003) SIAM J. Comput. , vol.32 , Issue.6 , pp. 1395-1402
    • Björklund, A.1    Husfeldt, T.2
  • 8
    • 0017216776 scopus 로고
    • Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms
    • K. S. Booth and G. S. Lueker. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. J. Comput. Syst. Sci. , 13: 335-379, 1976.
    • (1976) J. Comput. Syst. Sci. , vol.13 , pp. 335-379
    • Booth, K.S.1    Lueker, G.S.2
  • 11
    • 0024960539 scopus 로고
    • The Hamiltonian Circuit Problem for Circle Graphs is NP-complete
    • P. Damaschke. The Hamiltonian Circuit Problem for Circle Graphs is NP-complete. Info. Proc. Lett. , 32: 1-2, 1989.
    • (1989) Info. Proc. Lett. , vol.32 , pp. 1-2
    • Damaschke, P.1
  • 12
    • 38249002045 scopus 로고
    • Paths in Interval Graphs and Circular Arc Graphs
    • P. Damaschke. Paths in Interval Graphs and Circular Arc Graphs. Discr. Math. , 112: 49-64, 1993.
    • (1993) Discr. Math. , vol.112 , pp. 49-64
    • Damaschke, P.1
  • 14
    • 85030568489 scopus 로고
    • Data Structures for Weighted Matching and Nearest Common Ancestors with Linking
    • ACM
    • H. N. Gabow. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In Proc. 1st Ann. ACM-SIAM Symp. on Discr. Algo. , 434-443. ACM, 1990.
    • (1990) Proc. 1st Ann. ACM-SIAM Symp. on Discr. Algo. , pp. 434-443
    • Gabow, H.N.1
  • 16
    • 0003947606 scopus 로고    scopus 로고
    • Algorithmic Graph Theory and Perfect Graphs, 2/e
    • Elsevier
    • M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs, 2/e. Ann. Discr. Math. , 57. Elsevier, 2004.
    • (2004) Ann. Discr. Math. , vol.57
    • Golumbic, M.C.1
  • 18
    • 0001867234 scopus 로고    scopus 로고
    • On Approximating the Longest Path in a Graph
    • D. Karger, R. Motwani, and G. D. S. Ramkumar. On Approximating the Longest Path in a Graph. Algorithmica, 18: 82-98, 1997.
    • (1997) Algorithmica , vol.18 , pp. 82-98
    • Karger, D.1    Motwani, R.2    Ramkumar, G.D.S.3
  • 19
    • 0024610616 scopus 로고
    • An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
    • N. Korte and R. H. Möhring. An Incremental Linear-Time Algorithm for Recognizing Interval Graphs. SIAM J. Comput. , 18(1): 68-81, 1989.
    • (1989) SIAM J. Comput. , vol.18 , Issue.1 , pp. 68-81
    • Korte, N.1    Möhring, R.H.2
  • 20
    • 0042479122 scopus 로고
    • Longest Cycles in Threshold Graphs
    • N. V. R. Mahadev and U. N. Peled. Longest Cycles in Threshold Graphs. Discr. Math. , 135: 169-176, 1994.
    • (1994) Discr. Math. , vol.135 , pp. 169-176
    • Mahadev, N.V.R.1    Peled, U.N.2
  • 21
    • 0011228683 scopus 로고
    • How to Find Long Paths Efficiently
    • B. Monien. How to Find Long Paths Efficiently. Ann. Discr. Math. , 25: 239-254, 1985.
    • (1985) Ann. Discr. Math. , vol.25 , pp. 239-254
    • Monien, B.1
  • 22
    • 0042133278 scopus 로고    scopus 로고
    • Hamiltonian Circuit in Chordal Bipartite Graphs
    • H. Müller. Hamiltonian Circuit in Chordal Bipartite Graphs. Disc. Math. , 156: 291-298, 1996.
    • (1996) Disc. Math. , vol.156 , pp. 291-298
    • Müller, H.1
  • 23
    • 0037411883 scopus 로고    scopus 로고
    • An Approximation Algorithm for Computing Longest Paths
    • M. G. Scutellà. An Approximation Algorithm for Computing Longest Paths. European J. Oper. Res. , 148(3): 584-590, 2003.
    • (2003) European J. Oper. Res. , vol.148 , Issue.3 , pp. 584-590
    • Scutellà, M.G.1
  • 26
    • 0033894524 scopus 로고    scopus 로고
    • An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs
    • ACM
    • S. Vishwanathan. An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs. In Proc. 11th Ann. ACM-SIAM Symp. on Discr. Algo. , 680-685. ACM, 2000.
    • (2000) Proc. 11th Ann. ACM-SIAM Symp. on Discr. Algo. , pp. 680-685
    • Vishwanathan, S.1


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