LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
暂无分享,去创建一个
[1] George Steiner,et al. Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs , 1994, SIAM J. Comput..
[2] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..
[3] Stephan Olariu,et al. An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..
[5] H. A. Jung,et al. On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.
[6] Derek G. Corneil,et al. Lexicographic Breadth First Search - A Survey , 2004, WG.
[7] Jeremy P. Spinrad,et al. Modular decomposition and transitive orientation , 1999, Discret. Math..
[8] Jitender S. Deogun,et al. 1-Tough cocomparability graphs are hamiltonian , 1997, Discret. Math..
[9] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[10] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[11] Harold N. Gabow,et al. An Almost-Linear Algorithm for Two-Processor Scheduling , 1982, JACM.
[12] Jeremy P. Spinrad,et al. Efficient graph representations , 2003, Fields Institute monographs.
[13] Dieter Kratsch,et al. Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..
[14] Derek G. Corneil,et al. A Unified View of Graph Searching , 2008, SIAM J. Discret. Math..
[15] Stavros D. Nikolopoulos,et al. The Longest Path Problem is Polynomial on Cocomparability Graphs , 2010, WG.
[16] Stephan Olariu,et al. The LBFS Structure and Recognition of Interval Graphs , 2009, SIAM J. Discret. Math..
[17] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[18] Peter Damaschke,et al. Paths in interval graphs and circular arc graphs , 1993, Discret. Math..
[19] D. Kratsch,et al. Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm , 1991 .
[20] Stavros D. Nikolopoulos,et al. The Longest Path Problem has a Polynomial Solution on Interval Graphs , 2011, Algorithmica.
[21] Vasek Chvátal,et al. Tough graphs and hamiltonian circuits , 1973, Discret. Math..
[22] Derek G. Corneil,et al. A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs , 2010, SIAM J. Discret. Math..
[23] Rolf H. Möhring,et al. Computing the bump number is easy , 1988 .