Matches in SemOpenAlex for { <https://semopenalex.org/work/W4256295978> ?p ?o ?g. }
Showing items 1 to 52 of
52
with 100 items per page.
- W4256295978 abstract "Geometric routing by using virtual locations is an ele gant way for solving network routing problems. In its simplest form, greedy routing, a message is simply for warded to a neighbor that is closer to the destination. It has been an open conjecture whether every 3-connected plane graph has a greedy drawing in R2 (by Papadimitriou and Ratajczak [23]). Leighton and Moitra [20] recently settled this conjecture positively. One main drawback of this approach is that the coordinates of the virtual locations requires Ω(n log n) bits to repre sent (the same space usage as traditional routing table approaches). This makes greedy routing infeasible in applications. A similar result was obtained by Angelini et al. [2]. However, neither of the two papers give the time efficiency analysis of their algorithms. In addition, as pointed out in [16], the drawings in these two papers are not necessarily planar nor convex. In this paper, we show that the classical Schnyder drawing in R2 of plane triangulations is greedy with respect to a simple natural metric function H(u, v) over R2 that is equivalent to Euclidean metric DE(u, v) (in the sense that DE(u,v) < H(u, v) ≤ 2√2 DE(u, v).) The drawing is succinct, using two integer coordinates between 0 and 2n − 5. For 3-connected plane graphs, there is another conjecture by Papadimitriou and Ratajczak (as stated in [16]): Convex Greedy Embedding Conjecture: Every 3-connected planar graph has a convex greedy embedding in the Euclidean plane. In a recent paper [6], Cao et al. provided a plane graph G and showed that any convex greedy embedding of G in Euclidean plane must use Ω(n)-bit coordinates Thus, if we add the succinctness requirement, the Convex Greedy Embedding Conjecture is false In this paper, we show that the classical Schnyder drawing in R2 of 3-connected plane graphs is weakly greedy with respect to the same metric function H(*, *) The drawing is planar, convex, and succinct, using two integer coordinates between 0 and f (where f is the number of internal faces of G)." @default.
- W4256295978 created "2022-05-12" @default.
- W4256295978 creator A5027167896 @default.
- W4256295978 creator A5074983702 @default.
- W4256295978 date "2011-01-23" @default.
- W4256295978 modified "2023-09-29" @default.
- W4256295978 title "On Succinct Convex Greedy Drawing of 3-Connected Plane Graphs" @default.
- W4256295978 doi "https://doi.org/10.1137/1.9781611973082.115" @default.
- W4256295978 hasPublicationYear "2011" @default.
- W4256295978 type Work @default.
- W4256295978 citedByCount "8" @default.
- W4256295978 countsByYear W42562959782012 @default.
- W4256295978 countsByYear W42562959782013 @default.
- W4256295978 countsByYear W42562959782014 @default.
- W4256295978 countsByYear W42562959782016 @default.
- W4256295978 countsByYear W42562959782018 @default.
- W4256295978 countsByYear W42562959782019 @default.
- W4256295978 crossrefType "proceedings-article" @default.
- W4256295978 hasAuthorship W4256295978A5027167896 @default.
- W4256295978 hasAuthorship W4256295978A5074983702 @default.
- W4256295978 hasConcept C112680207 @default.
- W4256295978 hasConcept C11413529 @default.
- W4256295978 hasConcept C114614502 @default.
- W4256295978 hasConcept C17825722 @default.
- W4256295978 hasConcept C2524010 @default.
- W4256295978 hasConcept C33923547 @default.
- W4256295978 hasConcept C41008148 @default.
- W4256295978 hasConcept C51823790 @default.
- W4256295978 hasConceptScore W4256295978C112680207 @default.
- W4256295978 hasConceptScore W4256295978C11413529 @default.
- W4256295978 hasConceptScore W4256295978C114614502 @default.
- W4256295978 hasConceptScore W4256295978C17825722 @default.
- W4256295978 hasConceptScore W4256295978C2524010 @default.
- W4256295978 hasConceptScore W4256295978C33923547 @default.
- W4256295978 hasConceptScore W4256295978C41008148 @default.
- W4256295978 hasConceptScore W4256295978C51823790 @default.
- W4256295978 hasLocation W42562959781 @default.
- W4256295978 hasOpenAccess W4256295978 @default.
- W4256295978 hasPrimaryLocation W42562959781 @default.
- W4256295978 hasRelatedWork W10131964 @default.
- W4256295978 hasRelatedWork W15814062 @default.
- W4256295978 hasRelatedWork W15849867 @default.
- W4256295978 hasRelatedWork W15967914 @default.
- W4256295978 hasRelatedWork W16163219 @default.
- W4256295978 hasRelatedWork W1671437 @default.
- W4256295978 hasRelatedWork W3210618 @default.
- W4256295978 hasRelatedWork W7428044 @default.
- W4256295978 hasRelatedWork W804384 @default.
- W4256295978 hasRelatedWork W7973046 @default.
- W4256295978 isParatext "false" @default.
- W4256295978 isRetracted "false" @default.
- W4256295978 workType "article" @default.