514 search results - page 71 / 103 » Drawing a Graph in a Hypercube |
GD
2007
Springer
15 years 3 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
GD
2004
Springer
15 years 3 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
92
Voted
CGF
2010
14 years 9 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
GD
2003
Springer
15 years 2 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
77
Voted
APVIS
2006
14 years 11 months ago
2006
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...