A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
暂无分享,去创建一个
[1] Haiko Müller,et al. Hamiltonian circuits in chordal bipartite graphs , 1996, Discret. Math..
[2] Louis Ibarra,et al. Recognizing and representing proper interval graphs in parallel using merging and sorting , 2007, Discret. Appl. Math..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .
[5] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[6] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[7] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[8] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[9] Bhawani Sankar Panda,et al. A linear time recognition algorithm for proper interval graphs , 2003, Inf. Process. Lett..
[10] Yossi Shiloach,et al. A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.
[11] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[12] C. Pandu Rangan,et al. Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs , 1993, Theor. Comput. Sci..
[13] Shietung Peng,et al. Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs , 1990, ICPP.
[14] Peter Damaschke,et al. Paths in interval graphs and circular arc graphs , 1993, Discret. Math..
[15] Maw-Shang Chang,et al. Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, , 2005, Theor. Comput. Sci..
[16] Hyeong-Seok Lim,et al. Many-to-many Disjoint Path Covers in a Graph with Faulty Elements , 2004, ISAAC.
[17] Yasuto Suzuki,et al. Node-Disjoint Paths Algorithm in a Transposition Graph , 2006, IEICE Trans. Inf. Syst..
[18] Albert Y. Zomaya,et al. A time-optimal solution for the path cover problem on cographs , 2003, Theor. Comput. Sci..
[19] Alan A. Bertossi,et al. Finding Hamiltonian Circuits in Proper Interval Graphs , 1983, Inf. Process. Lett..
[20] Stavros D. Nikolopoulos,et al. A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs , 2007 .
[21] J. Mark Keil. Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..
[22] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[23] Sun-Yuan Hsieh,et al. An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs , 2004, J. Parallel Distributed Comput..
[24] B. Mohar,et al. Graph Minors , 2009 .
[25] Alan A. Bertossi,et al. Hamiltonian Circuits in Interval Graph Generalizations , 1986, Inf. Process. Lett..
[26] Jung-Heum Park. One-to-Many Disjoint Path Covers in a Graph with Faulty Elements , 2004, COCOON.
[27] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[28] Stavros D. Nikolopoulos. Parallel algorithms for Hamiltonian problems on quasi-threshold graphs , 2004, J. Parallel Distributed Comput..
[29] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[30] Stephan Olariu,et al. Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..
[31] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[32] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[33] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..
[34] Paul D. Seymour. Disjoint paths in graphs , 2006, Discret. Math..
[35] S. Olariu,et al. Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.