A new representation of proper interval graphs with an application to clique-width (Q2839207): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.endm.2009.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966894219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs / 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: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of 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: Clique-width minimization is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new representation of proper interval graphs with an application to clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal greedy algorithms for indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs / 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: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:15, 6 July 2024

scientific article
Language Label Description Also known as
English
A new representation of proper interval graphs with an application to clique-width
scientific article

    Statements

    A new representation of proper interval graphs with an application to clique-width (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2013
    0 references
    proper interval graphs
    0 references
    representation model
    0 references
    clique-width
    0 references

    Identifiers