1-page and 2-page drawings with bounded number of crossings per edge (Q1678086): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2017.07.009 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2747941151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-page crossing number of \(K_{n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Crossing Minimization of Almost-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement of graph drawings with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Outer 1-planar Graphs with Few Slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pagenumber of \(k\)-trees is \(O(k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelisation of genetic algorithms for the 2-page crossing number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Minimisation Heuristics for 2-page Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing minimization in linear embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Area Drawings of Plane 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Pagenumber of <i>k</i>-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the book thickness of $k$-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2017.07.009 / rank
 
Normal rank

Latest revision as of 02:45, 11 December 2024

scientific article
Language Label Description Also known as
English
1-page and 2-page drawings with bounded number of crossings per edge
scientific article

    Statements

    1-page and 2-page drawings with bounded number of crossings per edge (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2017
    0 references
    2-page drawings of planar graphs
    0 references
    1-page drawings of planar graphs
    0 references

    Identifiers