Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2036803675
@@ Property / OpenAlex ID: W2036803675 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits in interval graph generalizations
+Normal rank
@@ Property / cites work @@
+Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
+Normal rank
@@ Property / cites work @@
+Minimum node disjoint path covering for circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Corrigendum to ``The path-partition problem in block graphs''.
+Normal rank
@@ Property / cites work @@
+Deferred-query—An efficient approach for problems on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Deferred-query: An efficient approach for some problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Solving the all-pair shortest path query problem on interval and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+The Hamiltonian circuit problem for circle graphs is NP-complete
+Normal rank
@@ Property / cites work @@
+Paths in interval graphs and circular arc graphs
@@ Property / cites work: Paths in interval graphs and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
+Normal rank
@@ Property / cites work @@
+Q4256006
@@ Property / cites work: Q4256006 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Q3140413
@@ Property / cites work: Q3140413 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability in circular arc graphs
@@ Property / cites work: Stability in circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808624
@@ Property / cites work: Q4808624 / rank @@
+Normal rank
@@ Property / cites work @@
+$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in split graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Finding a minimum path cover of a distance-hereditary graph in polynomial time
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal path cover algorithm for cographs
@@ Property / cites work: An optimal path cover algorithm for cographs / rank @@
+Normal rank
@@ Property / cites work @@
+An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal covering of cacti by vertex-disjoint paths
+Normal rank
@@ Property / cites work @@
+On mapping processes to processors in distributed systems
+Normal rank
@@ Property / cites work @@
+Q4862336
@@ Property / cites work: Q4862336 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Optimal path cover problem on block graphs and bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Test for Circular-Arc Graphs
@@ Property / cites work: An Efficient Test for Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Interval graphs and maps of DNA
@@ Property / cites work: Interval graphs and maps of DNA / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal path cover problem on block graphs
@@ Property / cites work: Optimal path cover problem on block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The path-partition problem in block graphs
@@ Property / cites work: The path-partition problem in block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The path-partition problem in bipartite distance-hereditary graphs
+Normal rank