A simple routing algorithm based on Schnyder coordinates (Q391094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xin He / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047215131 / 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: Schnyder woods for higher genus triangulated surfaces, with applications to encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex drawings of 3-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation of virtual coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation of virtual coordinates for greedy routing in sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy drawings of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive reporting of disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Graph Drawing in the Hyperbolic Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex drawings of planar graphs and the order dimension of 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic embeddings and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnyder woods and orthogonal surfaces / 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: Q5365133 / 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: On a conjecture related to geometric routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs and poset dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized greedy routing algorithm for 2-connected graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:43, 7 July 2024

scientific article
Language Label Description Also known as
English
A simple routing algorithm based on Schnyder coordinates
scientific article

    Statements

    A simple routing algorithm based on Schnyder coordinates (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    network routing problems
    0 references
    greedy routing
    0 references
    geometric routing
    0 references
    Schnyder coordinates
    0 references
    0 references