1172 search results - page 92 / 235 » Path Algorithms on Regular Graphs |
119
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 21 days ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
105
click to vote
CIKM
2007
Springer
15 years 6 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...
104
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
113
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
106
Voted
MOC
2010
14 years 7 months ago
2010
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...