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

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 7643 || Range Extremum Queries

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

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 subm

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 6460 || Blocks of Hypergraphs

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

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Complexity Volume 1767 || On the Lovász Number of Certain Circulant Graphs

✍ Bongiovanni, Giancarlo; Petreschi, Rossella; Gambosi, Giorgio 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg ⚖ 308 KB

[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] 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 Algorithms Volume 7643 || Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction

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

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 subm