Powers of geometric intersection graphs and dispersion algorithms (Q1414578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in cocomparability graphs and their powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and generalizations, geometry and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of \(m\)-trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On powers of circular arc graphs and proper circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the length of longest increasing subsequences / 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 time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cuts for Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility dispersion problems under capacity and cost constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689814 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:08, 6 June 2024

scientific article
Language Label Description Also known as
English
Powers of geometric intersection graphs and dispersion algorithms
scientific article

    Statements

    Powers of geometric intersection graphs and dispersion algorithms (English)
    0 references
    0 references
    0 references
    4 December 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Powers of graphs
    0 references
    Intersection graphs
    0 references
    Interval graphs
    0 references
    Circular-arc graphs
    0 references
    Trapezoid graphs
    0 references
    Dispersion
    0 references