Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On embedding an outer-planar graph in a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms to Embed Trees in a Point Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding stacked polytopes on a polynomial-size grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-Set Embeddings of Plane 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs at fixed vertex locations / rank
 
Normal rank

Latest revision as of 00:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Embedding Plane 3-Trees in ℝ2 and ℝ3
scientific article

    Statements

    Embedding Plane 3-Trees in ℝ2 and ℝ3 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references