Straight-Line Rectangular Drawings of Clustered Graphs |
| |
| Authors: | Patrizio Angelini Fabrizio Frati Michael Kaufmann |
| |
| Affiliation: | 1.Departimento di Informatica e Automazione,Roma Tre University,Rome,Italy;2.Wilhelm-Schickard-Institut für Informatik,Universit?t Tübingen,Tübingen,Germany |
| |
| Abstract: | We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi (Algorithmica 44(1):1–32, 2006). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
