Beyond Clustered Planar Graphs (Q5001664): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizing Weak Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered planarity with pipes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the constraints of clustered planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advancements on SEFE and partitioned book embedding problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Planarity of Partially Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection-Link Representations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip planarity testing for embedded planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turning cliques into paths to achieve planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing k-modal embeddings of planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new perspective on clustered planarity as a combinatorial embedding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous planar graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Constrained Level Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial visibility representation extension problem / 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: Computing Maximum C-Planar Subgraphs / 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: Completely connected clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered planarity = flat clustered planarity / 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: On embedding a cycle in a plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing NodeTrix Representations of Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential-time and FPT algorithms for embedded flat clustered planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839007 / 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 Embedding of Planar Graphs with Few Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Embeddings of Graphs in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(c\)-planarity of embedded cyclic \(c\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs into Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hanani-Tutte for approximating maps of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Embeddability, Clustered Planarity, and Thickenability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity Testing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: NodeTrix planarity testing with small clusters / 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 / cites work
 
Property / cites work: Planarity Testing and Optimal Edge Insertion with Embedding Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Experience with Hanani-Tutte for Testing c-Planarity / 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: 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: 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: Simultaneous Embedding with Two Bends per Edge in Polynomial Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical planarity testing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous FPQ-ordering and hybrid planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending convex partial drawings of graphs / 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: Q3787505 / rank
 
Normal rank

Latest revision as of 06:05, 26 July 2024

scientific article; zbMATH DE number 7374193
Language Label Description Also known as
English
Beyond Clustered Planar Graphs
scientific article; zbMATH DE number 7374193

    Statements

    Beyond Clustered Planar Graphs (English)
    0 references
    0 references
    0 references
    22 July 2021
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers