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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in interval graph generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum node disjoint path covering for circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to ``The path-partition problem in block graphs''. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deferred-query—An efficient approach for problems on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deferred-query: An efficient approach for some problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the all-pair shortest path query problem on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian circuit problem for circle graphs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in interval graphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in split graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum path cover of a distance-hereditary graph in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal path cover algorithm for cographs / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal covering of cacti by vertex-disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mapping processes to processors in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and maps of DNA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path cover problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-partition problem in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-partition problem in bipartite distance-hereditary graphs / rank
 
Normal rank

Latest revision as of 13:56, 11 June 2024

scientific article
Language Label Description Also known as
English
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
scientific article

    Statements

    Solving the path cover problem on circular-arc graphs by using an approximation algorithm (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    Graph algorithms
    0 references
    Path cover
    0 references
    Hamiltonian cycle
    0 references
    Hamiltonian path
    0 references
    Interval graphs
    0 references
    Circular-arc graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers