Advancements on SEFE and partitioned book embedding problems (Q2339452): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964295405 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62046546 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.3607 / 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: Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes / 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: Straight-line drawing algorithms for hierarchical graphs and clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Planarity of Partially Embedded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Simultaneous Planarity when the Common Graph is 2-Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous embedding: edge orderings, relative positions, cutvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disconnectivity and Relative Positions in Simultaneous Embeddings / 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: Simultaneous Graph Embeddings with Fixed Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS / 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: Intersection Graphs in Simultaneous Embedding with Fixed Edges / 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: Total Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / 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: Relaxing the constraints of clustered planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs at fixed vertex locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some $\mathcal{NP}$ -complete SEFE Problems / rank
 
Normal rank

Latest revision as of 21:56, 9 July 2024

scientific article
Language Label Description Also known as
English
Advancements on SEFE and partitioned book embedding problems
scientific article

    Statements

    Advancements on SEFE and partitioned book embedding problems (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2015
    0 references
    sunflower SEFE
    0 references
    partitioned book embedding
    0 references
    Max SEFE
    0 references
    graph drawing
    0 references
    computational complexity
    0 references
    0 references
    0 references

    Identifiers

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