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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Carleton University
2022-09-01
|
| Schriftenreihe: | Journal of Computational Geometry |
| Online-Zugang: | https://jocg.org/index.php/jocg/article/view/3983 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|