1986 search results - page 237 / 398 » Path Separability of Graphs |
165
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
179
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
142
click to vote
WSC
2008
15 years 8 months ago
2008
As part of the DARPA Deep Green efforts, SAIC developed a multi-threaded and resolution approach to constructing and evaluating simulated futures to address the SimPath component....
163
click to vote
NAACL
2007
15 years 7 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
172
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...