3008 search results - page 329 / 602 » Independence in connected graphs |
178
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
205
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
146
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
187
click to vote
VALUETOOLS
2006
ACM
16 years 22 days ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
170
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...