1447 search results - page 169 / 290 » Graphs and Path Equilibria |
179
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
163
click to vote
IPL
2008
15 years 6 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
178
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
276
click to vote
TAPAS
2011
15 years 1 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...