Crossing-constrained hierarchical drawings (Q2458930): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138899 / 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: Width-restricted layering of acyclic digraphs with consideration of dummy nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs in two layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for the maximum acyclic subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawing software / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Theory and Hierarchy Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764046 / rank
 
Normal rank

Latest revision as of 12:32, 27 June 2024

scientific article
Language Label Description Also known as
English
Crossing-constrained hierarchical drawings
scientific article

    Statements

    Crossing-constrained hierarchical drawings (English)
    0 references
    0 references
    5 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Graph drawing
    0 references
    Hierarchical layout
    0 references
    Crossing minimization
    0 references
    NP-completeness
    0 references
    0 references