Sciweavers

169 search results - page 20 / 34
» Counting paths in digraphs
Sort
View
NSDI
2007
14 years 4 days ago
S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks
Routing protocols for wireless sensor networks must address the challenges of reliable packet delivery at increasingly large scale and highly constrained node resources. Attempts ...
Yun Mao, Feng Wang, Lili Qiu, Simon S. Lam, Jonath...
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 10 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 10 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
DCG
1999
81views more  DCG 1999»
13 years 9 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
IJCGA
2010
86views more  IJCGA 2010»
13 years 8 months ago
Leaving an Unknown Maze Using an Error-Prone Compass
Imagine you are trapped in a maze of caves. All you have is an old rusty compass and barely enough light to read it. How much inaccuracy can you allow to ensure that you can leave...
Tom Kamphans, Elmar Langetepe