Strip planarity testing for embedded planar graphs (Q524364): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62046544 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1816979946 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.0683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the running time of embedded upward planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible Connectivity-Augmentation of Planar Disconnected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line rectangular drawings of clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Importance of Being Proper / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radial Level Planarity Testing and Embedding in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward drawings of triconnected digraphs. / 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: Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on Testing C-Planarity of Embedded Flat Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Cycles into Cycles of Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding a cycle in a plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for plane representations of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward Spirality and Upward Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line drawing algorithms for hierarchical graphs and clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Characterization of Level Planar Trees by Minimal Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2004: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Level Nonplanar Patterns for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the Hanani-Tutte Theorem for Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Upward and Rectilinear Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity Testing and Optimal Edge Insertion with Embedding Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of level planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward Planar Drawing of Single-Source Acyclic Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kuratowski-type theorem for planarity of partially embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short path queries in planar graphs in constant time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Isomorphic Graphs / rank
 
Normal rank

Latest revision as of 18:48, 13 July 2024

scientific article
Language Label Description Also known as
English
Strip planarity testing for embedded planar graphs
scientific article

    Statements

    Strip planarity testing for embedded planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planarity
    0 references
    clustered planarity
    0 references
    upward planarity
    0 references
    level planarity
    0 references
    embedded graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references