The Longest Path Problem Is Polynomial on Cocomparability Graphs
暂无分享,去创建一个
[1] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[4] Alan A. Bertossi,et al. Finding Hamiltonian Circuits in Proper Interval Graphs , 1983, Inf. Process. Lett..
[5] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[6] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[7] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[8] Rolf H. Möhring,et al. Computing the bump number is easy , 1988 .
[9] Giri Narasimhan,et al. A Note on the Hamiltonian Circuit Problem on Directed Path Graphs , 1989, Inf. Process. Lett..
[10] Peter Damaschke,et al. The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete , 1989, Inf. Process. Lett..
[11] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..
[12] D. Kratsch,et al. Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm , 1991 .
[13] Peter Damaschke,et al. Paths in interval graphs and circular arc graphs , 1993, Discret. Math..
[14] George Steiner,et al. Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs , 1994, SIAM J. Comput..
[15] Haiko Müller,et al. Hamiltonian circuits in chordal bipartite graphs , 1996, Discret. Math..
[16] Sheng-Lung Peng,et al. Deferred-query: An efficient approach for some problems on interval graphs , 1999, Networks.
[17] Sundar Vishwanathan,et al. An approximation algorithm for finding a long path in Hamiltonian graphs , 2000, SODA '00.
[18] A. J. M. van Gasteren,et al. On computing a longest path in a tree , 2002, Inf. Process. Lett..
[19] A. ADoefaa,et al. ? ? ? ? f ? ? ? ? ? , 2003 .
[20] Ryuhei Uehara,et al. Efficient Algorithms for the Longest Path Problem , 2004, ISAAC.
[21] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[22] Harold N. Gabow,et al. Finding paths and cycles of superpolylogarithmic length , 2004, STOC '04.
[23] Rajeev Motwani,et al. Finding large cycles in Hamiltonian graphs , 2005, SODA '05.
[24] David R. Karger,et al. On approximating the longest path in a graph , 1997, Algorithmica.
[25] Ryuhei Uehara,et al. Linear structure of bipartite permutation graphs and the longest path problem , 2007, Inf. Process. Lett..
[26] Zhao Zhang,et al. Algorithms for long paths in graphs , 2007, Theor. Comput. Sci..
[27] Ryuhei Uehara,et al. Simple Geometrical Intersection Graphs , 2008, WALCOM.
[28] Harold N. Gabow,et al. Finding Long Paths, Cycles and Circuits , 2008, ISAAC.
[29] Ryuhei Uehara,et al. Longest Path Problems on Ptolemaic Graphs , 2008, IEICE Trans. Inf. Syst..
[30] Katerina Asdre,et al. The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs , 2008, Algorithmica.
[31] Stavros D. Nikolopoulos,et al. The Longest Path Problem has a Polynomial Solution on Interval Graphs , 2011, Algorithmica.