970 search results - page 93 / 194 » On encodings of spanning trees |
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
IPL
1998
13 years 8 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
MOR
2010
13 years 7 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...