On self-approaching and increasing-chord drawings of 3-connected planar graphs
<p>An $st$-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from $s$ to any point $t'$ on the curve the distance to $t'$ is non-increasing. A path has increasing chords if it is self-approaching in both directions. A drawing is self-approaching (inc...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Carleton University
2016-02-01
|
| Sraith: | Journal of Computational Geometry |
| Rochtain ar líne: | http://jocg.org/index.php/jocg/article/view/223 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|