A new perspective on clustered planarity as a combinatorial embedding problem (Q897898): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.10.011 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1805816469 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.05673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical planarity testing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely connected clustered graphs / 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: Clustered Planarity: Clusters with Few Outgoing Edges / 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: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems / 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: On-line maintenance of triconnected components with SPQR-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned 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: Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs / 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: Shrinking the Search Space for Clustered Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-Planarity of C-Connected Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422278 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.10.011 / rank
 
Normal rank

Latest revision as of 07:40, 10 December 2024

scientific article
Language Label Description Also known as
English
A new perspective on clustered planarity as a combinatorial embedding problem
scientific article

    Statements

    A new perspective on clustered planarity as a combinatorial embedding problem (English)
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    graph drawing
    0 references
    clustered planarity
    0 references
    constrained planar embedding
    0 references
    characterization
    0 references
    algorithms
    0 references

    Identifiers

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