On the parameterized complexity of layered graph drawing (Q958215): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57359905, #quickstatements; #temporary_batch_1712286835472
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-007-9151-1 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of embedding planar graphs to minimize certain distance measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs on Two and Three Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter approach to 2-layer planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation / 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: Two-Layer Planarization: Improving on Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of \(k\)-connected graphs of pathwidth \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing crossing numbers in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laying Out Graphs Using Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PATHWIDTH AND LAYERED DRAWINGS OF TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with the Fixed-Parameter Approach for Two-Layer Planarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Theory and Hierarchy Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and maps of DNA / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-007-9151-1 / rank
 
Normal rank

Latest revision as of 09:59, 10 December 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of layered graph drawing
scientific article

    Statements

    On the parameterized complexity of layered graph drawing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2008
    0 references
    crossing-free \(h\)-layer drawings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references