Opening book details…
Can I read Drawing C-planar Biconnected Clustered Graphs on EtoBox?
Drawing C-planar Biconnected Clustered Graphs by Hiroshi Nagamochi; Katsutoshi Kuroya is a Computer Science article available to read on EtoBox.
What is Drawing C-planar Biconnected Clustered Graphs about?
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.
Who reads Drawing C-planar Biconnected Clustered Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Hiroshi Nagamochi; Katsutoshi Kuroya
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2007
- Language
- EN
- Field
- Computer Science (Physical Sciences)