3958 search results - page 144 / 792 » Dynamic Graph Algorithms with Applications |
193
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
159
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
150
click to vote
ICHIT
2009
Springer
16 years 27 days ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
188
click to vote
FOCS
2008
IEEE
16 years 24 days 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...
173
click to vote
PPAM
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...