1986 search results - page 206 / 398 » Path Separability of Graphs |
135
Voted
GD
2000
Springer
15 years 6 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...
115
click to vote
IPL
2008
15 years 2 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, ...
125
Voted
MICCAI
2010
Springer
15 years 24 days 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...
199
click to vote
TAPAS
2011
14 years 9 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...
105
click to vote
GBRPR
2009
Springer
15 years 9 months ago
2009
Springer
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....