Recognizing weighted and seeded disk graphs
Disk intersection representations realize graphs by mapping vertices bijectively to disks in the plane such that two disks intersect each other if and only if the corresponding vertices are adjacent in the graph. If intersections are restricted to touching points of the boundaries, we call them dis...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Carleton University
2022-09-01
|
| Edice: | Journal of Computational Geometry |
| On-line přístup: | https://jocg.org/index.php/jocg/article/view/3983 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|