✦ LIBER ✦

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 8288 || Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

✍ Scribed by Lecroq, Thierry; Mouchard, Laurent

Book ID: 121745619
Publisher: Springer Berlin Heidelberg
Year: 2013
Tongue: English
Weight: 222 KB
Edition: 2
Category: Article
ISBN: 3642452787
DOI: 10.1007/978-3-642-45278-9_11

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computations Volume 1004 || Weighted domination on cocomparability graphs

✍ Staples, John; Eades, Peter; Katoh, Naoki; Moffat, Alistair 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 592 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms — ESA '96 Volume 1136 || Parallel algorithms for series parallel graphs

✍ Diaz, Josep; Serna, Maria 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 755 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 7643 || On the Steiner Radial Number of Graphs

✍ Arumugam, S.; Smyth, W. F. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 174 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4627 || Approximation Algorithms and Hardness for Domination with Propagation

✍ Charikar, Moses; Jansen, Klaus; Reingold, Omer; Rolim, José D. P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 647 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 6460 || On Antimagic Labeling for Generalized Web and Flower Graphs

✍ Iliopoulos, Costas S.; Smyth, William F. 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 164 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial and Algorithmic Aspects of Networking Volume 4852 || Combinatorial Algorithms for Listing Paths in Minimal Change Order

✍ Janssen, Jeannette; Prałat, Paweł 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 462 KB