Every Schnyder drawing is a greedy embedding
ContributorsLeone, Pierre; Wijesiriwardana, Kasun; Rolim, Jose
Published inTheoretical computer science, vol. 807, p. 234-244
Publication date2019-07-19
First online date2019-07-19
Keywords
- Schnyder drawing
- Greedy embedding
- Greedy routing
- Maximal planar graphs
Affiliation
Research group
Citation (ISO format)
LEONE, Pierre, WIJESIRIWARDANA, Kasun, ROLIM, Jose. Every Schnyder drawing is a greedy embedding. In: Theoretical computer science, 2019, vol. 807, p. 234–244. doi: 10.1016/j.tcs.2019.07.021
Main files (1)
Article (Published version)
Identifiers
- PID : unige:165509
- DOI : 10.1016/j.tcs.2019.07.021
ISSN of the journal0720-7786
