M. Fuchs
YOU?
Author Swipe
View article: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms Open
In this paper, we give list coloring variants of simple iterative defective coloring algorithms. Formally, in a list defective coloring instance, each node $v$ of a graph is given a list $L_v$ of colors and a list of allowed defects $d_v(x…
View article: List Defective Colorings: Distributed Algorithms and Applications
List Defective Colorings: Distributed Algorithms and Applications Open
The distributed coloring problem is at the core of the area of distributed graph algorithms and it is a problem that has seen tremendous progress over the last few years. Much of the remarkable recent progress on deterministic distributed …
View article: Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings Open
We provide CONGEST model algorithms for approximating minimum weighted vertex cover and the maximum weighted matching. For bipartite graphs, we show that a $(1+\varepsilon)$-approximate weighted vertex cover can be computed deterministical…
View article: Erratum: Modification of the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>ω</mml:mi></mml:math>-Meson Lifetime in Nuclear Matter [Phys. Rev. Lett.<b>100</b>, 192302 (2008)]
Erratum: Modification of the-Meson Lifetime in Nuclear Matter [Phys. Rev. Lett.<b>100</b>, 192302 (2008)] Open
Received 22 April 2015DOI:https://doi.org/10.1103/PhysRevLett.114.199903© 2015 American Physical Society