1108 search results - page 6 / 222 » Clustered Level Planarity |
FOCS
2003
IEEE
14 years 23 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
GD
2005
Springer
14 years 1 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
DATAMINE
2007
13 years 7 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
VIIP
2001
13 years 8 months ago
2001
Closed streamlines are an integral part of vector field topology, since they behave like sources respectively sinks but are often neither considered nor detected. If a streamline ...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...