The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
- 4 March 2009
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 58 (3) , 679-710
Abstract
No abstract availableKeywords
All Related Versions
This publication has 27 references indexed in Scilit:
- A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographsNetworks, 2007
- Graph Classes: A Survey1999
- Paths in interval graphs and circular arc graphsDiscrete Mathematics, 1993
- Linear algorithm for optimal path cover problem on interval graphsInformation Processing Letters, 1990
- Hamiltonian circuits in interval graph generalizationsInformation Processing Letters, 1986
- Finding Hamiltonian circuits in proper interval graphsInformation Processing Letters, 1983
- 2-Linked GraphsEuropean Journal of Combinatorics, 1980
- A Polynomial Solution to the Undirected Two Paths ProblemJournal of the ACM, 1980
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976