𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of distributed graph coloring with local minimality constraints

✍ Scribed by Cyril Gavoille; Ralf Klasing; Adrian Kosowski; Łukasz Kuszner; Alfredo Navarra

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
135 KB
Volume
54
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A probabilistic local majority polling g
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
✍ Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach

Local lipschitz regularity of vector val
Local lipschitz regularity of vector valued local minimizers of variational integrals with densities depending on the modulus of the gradient
✍ Martin Fuchs 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract If \documentclass{article}\usepackage{amssymb}\pagestyle{empty}\begin{document}$u : {\mathbb R}^{n}\supset \Omega \rightarrow {\mathbb R}^{M} $\end{document} locally minimizes the functional ∫~Ω~__h__(|∇__u__|) __dx__ with __h__ such that ${{h^{\prime }(t)}\over{t}} \le h^{\prime \prime