An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11786-009-0004-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11786-009-0004-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147102683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time recognition algorithm for proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs / rank
 
Normal rank
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: An optimal path cover algorithm for cographs / 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: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite 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: Solving the path cover problem on circular-arc graphs by using an approximation algorithm / 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: A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix characterization of interval and proper interval graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11786-009-0004-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:41, 9 December 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs
scientific article

    Statements

    An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (English)
    0 references
    0 references
    0 references
    19 February 2011
    0 references
    proper interval graph
    0 references
    perfect graph
    0 references
    path cover
    0 references
    SNIR matrix
    0 references
    linear-time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references