144 search results - page 3 / 29 » Path extendability of claw-free graphs |
CORR
2012
Springer
12 years 1 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
SCAM
2007
IEEE
14 years 1 days ago
2007
IEEE
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
ESWS
2007
Springer
13 years 12 months ago
2007
Springer
Complex relationships, frequently referred to as semantic associations, are the essence of the Semantic Web. Query and retrieval of semantic associations has been an important task...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
SIAMCOMP
2010
13 years 4 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...