4865 search results - page 481 / 973 » The Complexity of Graph Connectivity |
170
click to vote
ATMOS
2010
15 years 6 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
160
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
166
click to vote
SPAA
2004
ACM
16 years 11 days ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
188
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
177
click to vote
CN
2006
15 years 7 months ago
2006
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...