Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree loop graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the unit interval number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp edge bound on the interval number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recovering syntenic blocks from comparative maps / 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: Approximating the 2-interval pattern problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restrictions of Balanced 2-Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal values of the interval number of a graph, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Values of the Interval Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip Graphs: Recognition and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing d-Interval Graphs and d-Track Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of some optimization problems related to multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of maximal strip recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the interval number of a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité de l'arboricité linéaire d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On double and multiple interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of 2-interval pattern matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the degree bound for interval number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs with fixed interval number is NP-complete / rank
 
Normal rank

Latest revision as of 14:31, 6 July 2024

scientific article
Language Label Description Also known as
English
Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
scientific article

    Statements

    Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (English)
    0 references
    0 references
    25 June 2013
    0 references
    0 references
    computational complexity
    0 references
    graph recognition
    0 references
    bioinformatics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references