Fixed edge-length graph drawing is NP-hard (Q1813977): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56001823, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of drawing trees nicely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class Of Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer flows / rank
 
Normal rank

Latest revision as of 08:31, 15 May 2024

scientific article
Language Label Description Also known as
English
Fixed edge-length graph drawing is NP-hard
scientific article

    Statements

    Fixed edge-length graph drawing is NP-hard (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    computational geometry
    0 references
    graph layout
    0 references
    planar graph
    0 references
    2-connected graph
    0 references

    Identifiers