1986 search results - page 115 / 398 » Path Separability of Graphs |
CIKM
2007
Springer
14 years 3 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
FCT
2009
Springer
14 years 24 days ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...