Disconnectivity and relative positions in simultaneous embeddings (Q2349740): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simultaneous Graph Embeddings with Fixed Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417619 / 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: 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: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems / 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: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants / 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: On-Line Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank

Latest revision as of 06:30, 10 July 2024

scientific article
Language Label Description Also known as
English
Disconnectivity and relative positions in simultaneous embeddings
scientific article

    Statements

    Disconnectivity and relative positions in simultaneous embeddings (English)
    0 references
    0 references
    0 references
    17 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planarity
    0 references
    simultaneous embedding
    0 references
    algorithm
    0 references
    embedding representation
    0 references
    0 references
    0 references