On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20539 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988290157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lambert \(w\) function / 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: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roberts characterization of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / 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: Q4138414 / rank
 
Normal rank

Latest revision as of 12:24, 4 July 2024

scientific article
Language Label Description Also known as
English
On partitioning interval graphs into proper interval subgraphs and related problems
scientific article

    Statements

    On partitioning interval graphs into proper interval subgraphs and related problems (English)
    0 references
    0 references
    12 October 2011
    0 references
    interval graphs
    0 references
    circular-arc graphs
    0 references
    proper interval graphs
    0 references
    graph partitioning problems
    0 references
    efficient graph algorithms
    0 references

    Identifiers

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