Clustered planarity

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)
Wikipedia

Topic mentions per year

Topic mentions per year

2005-2018
02420052018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2015
2015
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2014
2014
The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
A clustered graph is a graph augmented with a hierarchical inclusion structure over its vertices, and arises very naturally in… (More)
  • figure 1
  • table 1
Is this relevant?
Review
2009
Review
2009
We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C containing clusters of size at most… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?