✦ LIBER ✦

Graph coloring with cardinality constraints on the neighborhoods

✍ Scribed by M.-C. Costa; D. de Werra; C. Picouleau; B. Ries

Book ID: 108114386
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 637 KB
Volume: 6
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.04.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring Graphs with Sparse Neighborhood

Coloring Graphs with Sparse Neighborhoods

✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d 2 Âf is at most O(dÂlog f ). This is tight (up to a constant factor) for all admissible values of d and f.

On the complexity of distributed graph c

On the complexity of distributed graph coloring with local minimality constraints

✍ Cyril Gavoille; Ralf Klasing; Adrian Kosowski; Łukasz Kuszner; Alfredo Navarra 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Genetic local search the graph partition

Genetic local search the graph partitioning problem under cardinality constraints

✍ Yu. A. Kochetov; A. V. Plyasunov 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 257 KB

On coloring problems with local constrai

On coloring problems with local constraints

✍ Flavia Bonomo; Yuri Faenza; Gianpaolo Oriolo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The impact of 2-neighborhoods on graph s

The impact of 2-neighborhoods on graph structure

✍ D. V. Paduchikh 📂 Article 📅 1997 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 320 KB

Algorithms for on-line bin-packing probl

Algorithms for on-line bin-packing problems with cardinality constraints

✍ Luitpold Babel; Bo Chen; Hans Kellerer; Vladimir Kotov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 291 KB