2294 search results - page 139 / 459 » From Path Graphs to Directed Path Graphs |
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
109
click to vote
ALGORITHMICA
2010
14 years 8 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
MICCAI
2007
Springer
15 years 11 months ago
2007
Springer
This paper incorporates multiscale vesselness filtering into the Livewire framework to simultaneously compute optimal medial axes and boundaries in vascular images. To this end, we...
ICOIN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
100
click to vote
IDEAS
2000
IEEE
15 years 2 months ago
2000
IEEE
I n this paper, we address the problem of query processing o n distributed semi-structured data. The distributed semistructured data can be modeled as a rooted and edge-labeled gr...