239 search results - page 20 / 48 » The path partition problem and related problems in bipartite... |
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
DLT
2008
13 years 9 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...