✦ LIBER ✦

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

✍ Scribed by Staples, John; Eades, Peter; Katoh, Naoki; Moffat, Alistair

Book ID: 120762762
Publisher: Springer Berlin Heidelberg
Year: 1995
Weight: 592 KB
Category: Article
ISBN: 3540477667
DOI: 10.1007/BFb0015415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 7276 || Engineering Graph Partitioning Algorithms

✍ Klasing, Ralf 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 388 KB

This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present curre

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6507 || k-cyclic Orientations of Graphs

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 238 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010. The 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Boo

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6506 || Bounded Max-colorings of Graphs

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 254 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Exact (Exponential) Algorithms for the Dominating Set Problem

✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V

[Lecture Notes in Computer Science] Comb

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

✍ Lecroq, Thierry; Mouchard, Laurent 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 222 KB

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

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms - ESA 2003 Volume 2832 || Experiments on Graph Clustering Algorithms

✍ Di Battista, Giuseppe; Zwick, Uri 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 294 KB

This Book Constitutes The Refereed Proceedings Of The 11th Annual European Symposium On Algorithms, Esa 2003, Held In Budapest, Hungary, In September 2003. The 66 Revised Full Papers Presented Were Carefully Reviewed And Selected From 165 Submissions. The Scope Of The Papers Spans The Entire Range O