In graph drawing, a clustered planar graph is a graph together with a hierarchical clustering on its vertices, such that the graph drawn togetherâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Patrizio Angelini, Giordano Da Lozzo
- ISAAC
- 2016

We study the version of the C-PLANARITY problem in which edges connecting the same pair of clusters must be grouped into pipesâ€¦Â (More)

Is this relevant?

2015

2015

- Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
- Comput. Geom.
- 2015

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are representedâ€¦Â (More)

Is this relevant?

2014

2014

- Thomas BlÃ¤sius, Ignaz Rutter
- Graph Drawing
- 2014

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that theâ€¦Â (More)

Is this relevant?

2014

2014

- Radoslav Fulek, Jan Kyncl, Igor Malinovic, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi
- Graph Drawing
- 2014

The Hananiâ€“Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphsâ€¦Â (More)

Is this relevant?

2012

2012

- Markus Chimani, Karsten Klein
- Graph Drawing
- 2012

A clustered graph is a graph augmented with a hierarchical inclusion structure over its vertices, and arises very naturally inâ€¦Â (More)

Is this relevant?

Review

2009

Review

2009

- Eva JelÃnkovÃ¡, Jan KÃ¡ra, Jan KratochvÃl, Martin Pergel, Ondrej SuchÃ½, TomÃ¡s Vyskocil
- J. Graph Algorithms Appl.
- 2009

We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C containing clusters of size at mostâ€¦Â (More)

Is this relevant?

2009

2009

A 2-page book embedding of a graph places the vertices linearly on a spine (a line segment) and the edges on two pages (two halfâ€¦Â (More)

Is this relevant?

2008

2008

- VÃt JelÃnek, Eva JelÃnkovÃ¡, Jan KratochvÃl, Bernard LidickÃ½
- Graph Drawing
- 2008

We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that everyâ€¦Â (More)

Is this relevant?

2006

2006

We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clusteredâ€¦Â (More)

Is this relevant?

2006

2006

We present a linear time c-planarity testing and embedding algorithm for c-connected clustered graphs. The algorithm is based onâ€¦Â (More)

Is this relevant?