64 search results - page 11 / 13 » Exact Elimination of Cycles in Graphs |
CP
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
JCT
2010
13 years 5 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
NOMS
2002
IEEE
14 years 8 days ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...