✦ LIBER ✦

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

✍ Scribed by Iliopoulos, Costas S.; Smyth, William F.

Book ID: 118160642
Publisher: Springer Berlin Heidelberg
Year: 2011
Weight: 164 KB
Category: Article
ISBN: 364219222X
DOI: 10.1007/978-3-642-19222-7_31

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Models for the Web-Graph Volume 6516 || Modeling Traffic on the Web Graph

✍ Kumar, Ravi; Sivakumar, Dandapani 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 463 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Models for the Web-Graph Volume 4863 || Manipulation-Resistant Reputations Using Hitting Time

✍ Bonato, Anthony; Chung, Fan R. K. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 430 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

[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] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || On Bounded Distance Decoding for General Lattices

✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 534 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A compact data structure and parallel algorithms for permutation graphs

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 383 KB