Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2918486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unit interval graphs with integer endpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of unit circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformization of linear arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending partial representations of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the canonical representation and star system problems for proper circular-arc graphs in logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of cycles, powers of paths, and distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Circular-Arc Graph Representations and Feasible Circulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal representation of a semiorder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthetic description of a semiorder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorems for some circular-arc graphs / rank
 
Normal rank

Latest revision as of 20:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms
scientific article

    Statements

    Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (English)
    0 references
    0 references
    16 May 2017
    0 references
    0 references
    0 references