The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
From MaRDI portal
Publication:3507334
DOI10.1007/978-3-540-69311-6_23zbMath1143.68499OpenAlexW1502434717MaRDI QIDQ3507334
Katerina Asdre, Stavros D. Nikolopoulos
Publication date: 19 June 2008
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_23
perfect graphscographslinear-time algorithmspath covercomplement reducible graphsfixed-endpoint path cover
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
- Linear algorithm for optimal path cover problem on interval graphs
- Complement reducible graphs
- Paths in interval graphs and circular arc graphs
- Optimal path cover problem on block graphs and bipartite permutation graphs
- Modular decomposition and transitive orientation
- A time-optimal solution for the path cover problem on cographs.
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
- An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
- An optimal path cover algorithm for cographs
- HAMILTONian circuits in chordal bipartite graphs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- A Linear Recognition Algorithm for Cographs
- Graph Classes: A Survey
- A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
This page was built for publication: The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
