446 search results - page 23 / 90 » A fast algorithm for computing steiner edge connectivity |
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
ASUNAM
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
104
click to vote
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
WG
2009
Springer
15 years 4 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
112
click to vote
SIAMSC
2011
14 years 14 days ago
2011
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...