Euclidean greedy drawings of trees (Q2411820): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743497332 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.5224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-approaching Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct greedy drawings do not always exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Construct Greedy Drawings of Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planar greedy drawings of 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing-Chord Graphs On Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy drawings of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Angles of Planar Triangular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Geometric Routing Using Hyperbolic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2889031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Geometric Routing in the Euclidean Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-approaching curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on greedy embeddings in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Greedy Drawings of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-approaching and increasing-chord drawings of 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture related to geometric routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct strictly convex greedy drawing of 3-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless Sensor Networks / rank
 
Normal rank

Latest revision as of 15:36, 14 July 2024

scientific article
Language Label Description Also known as
English
Euclidean greedy drawings of trees
scientific article

    Statements

    Euclidean greedy drawings of trees (English)
    0 references
    0 references
    0 references
    25 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    greedy drawings
    0 references
    tree drawings
    0 references
    greedy routing
    0 references
    0 references
    0 references