2294 search results - page 221 / 459 » From Path Graphs to Directed Path Graphs |
135
click to vote
DASFAA
2010
IEEE
15 years 8 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
139
click to vote
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...
113
click to vote
CORR
2008
Springer
15 years 3 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 ...
119
click to vote
IPL
2008
15 years 3 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, ...
214
click to vote
TAPAS
2011
14 years 10 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...