Name
Abstract | ||
|---|---|---|
Let P be a set of n≥5 points in convex position in the plane. The path graph G(P) of P is an abstract graph whose vertices are non-crossing spanning paths of P, such that two paths are adjacent if one can be obtained from the other by deleting an edge and adding another edge. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.comgeo.2018.02.002 | Computational Geometry |
Keywords | DocType | Volume |
Geometric graphs,Hamiltonian paths,Reconstruction,Convex geometric graphs | Journal | 72 |
ISSN | Citations | PageRank |
0925-7721 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chaya Keller | 1 | 3 | 4.52 |
| Yael Stein | 2 | 0 | 0.34 |