An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
暂无分享,去创建一个
[1] T. Kraußer,et al. A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption , 2007 .
[2] Wen-Lian Hsu,et al. A Simple Test for Interval Graphs , 1992, WG.
[3] Peter Damaschke,et al. Paths in interval graphs and circular arc graphs , 1993, Discret. Math..
[4] Roded Sharan,et al. A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 1999, SIAM J. Comput..
[5] Yehoshua Perl,et al. Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..
[6] Bhawani Sankar Panda,et al. A linear time recognition algorithm for proper interval graphs , 2003, Inf. Process. Lett..
[7] Sheng-Lung Peng,et al. Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract) , 1993, WADS.
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Joseph Y.-T. Leung,et al. Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.
[10] Jean Utke,et al. OpenAD/F: A Modular Open-Source Tool for Automatic Differentiation of Fortran Codes , 2008, TOMS.
[11] Stavros D. Nikolopoulos,et al. A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs , 2007 .
[12] Haiko Müller,et al. Hamiltonian circuits in chordal bipartite graphs , 1996, Discret. Math..
[13] Andrea Walther,et al. Adjoints for Time-Dependent Optimal Control , 2008 .
[14] George B. Mertzios. A polynomial algorithm for the k-cluster problem on the interval graphs , 2006, Electron. Notes Discret. Math..
[15] Stephan Olariu,et al. Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..
[16] Chuan Yi Tang,et al. An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs , 1992, Inf. Process. Lett..
[17] George B. Mertzios. A matrix characterization of interval and proper interval graphs , 2008, Appl. Math. Lett..
[18] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[19] Martin Charles Golumbic,et al. Directed tolerance graphs , 2004 .
[20] S. Olariu,et al. An optimal path cover algorithm for cographs , 1995 .
[21] A. Carrano. Establishing the order of human chromosome-specific DNA fragments. , 1988, Basic life sciences.
[22] Mesut Gunes,et al. From Simulations to Testbeds — Architecture of the Hybrid MCG-Mesh Testbed , 2006 .
[23] Shietung Peng,et al. Parallel Algorithms for Path Covering, Hamiltonian Path and Hamiltonian Cycle in Cographs , 1990, ICPP.
[24] Katerina Asdre,et al. A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs , 2010, Theor. Comput. Sci..
[25] C. Pandu Rangan,et al. Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs , 1993, Theor. Comput. Sci..
[26] C. Pandu Rangan,et al. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs , 1990, Inf. Process. Lett..
[27] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[28] Stephan Olariu,et al. The ultimate interval graph recognition algorithm? , 1998, SODA '98.
[29] Alan A. Bertossi,et al. Hamiltonian Circuits in Interval Graph Generalizations , 1986, Inf. Process. Lett..
[30] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[31] Jürgen Giesl,et al. SAT Solving for Termination Analysis with Polynomial Interpretations , 2007, SAT.
[32] Maw-Shang Chang,et al. Solving the path cover problem on circular-arc graphs by using an approximation algorithm , 2006, Discret. Appl. Math..
[33] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .