Sciweavers

514 search results - page 41 / 103
» Drawing a Graph in a Hypercube
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
14 years 11 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
63
Voted
CSCW
2006
ACM
15 years 3 months ago
Draw-together: graphical editor for collaborative drawing
Collaborative object-based graphical editors offer good support for design teams to work concurrently on their design. However, not much research has been done on maintaining cons...
Claudia-Lavinia Ignat, Moira C. Norrie
GD
2006
Springer
15 years 1 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
15 years 2 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
81
Voted
GD
2006
Springer
15 years 1 months ago
Upright-Quad Drawing of st -Planar Learning Spaces
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
David Eppstein