✦ LIBER ✦

[Lecture Notes in Computer Science] Combinatorial Optimization Volume 7422 || Selective Graph Coloring in Some Special Classes of Graphs

✍ Scribed by Mahjoub, A. Ridha; Markakis, Vangelis; Milis, Ioannis; Paschos, Vangelis Th.

Book ID: 111984420
Publisher: Springer Berlin Heidelberg
Year: 2012
Tongue: English
Weight: 225 KB
Edition: 1
Category: Article
ISBN: 364232147X
DOI: 10.1007/978-3-642-32147-4_29

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization Volume 7422 || Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs

✍ Mahjoub, A. Ridha; Markakis, Vangelis; Milis, Ioannis; Paschos, Vangelis Th. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 278 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 6831 || A Note on Treewidth in Random Graphs

✍ Wang, Weifan; Zhu, Xuding; Du, Ding-Zhu 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 185 KB

This Book Constitutes The Refereed Proceedings Of The 5th International Conference On Combinatorial Optimization And Applications, Cocoa 2011, Held In Zhangjiajie, China, In August 2011. The 43 Revised Full Papers Were Carefully Reviewed And Selected From 65 Submissions. The Papers Cover A Broad Ran

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1084 || Approximating k-set cover and complementary graph coloring

✍ Cunningham, William H.; McCormick, S. Thomas; Queyranne, Maurice 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 835 KB

On the complexity of the selective graph

On the complexity of the selective graph coloring problem in some special classes of graphs

✍ Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB

[Lecture Notes in Computer Science] Evol

[Lecture Notes in Computer Science] Evolutionary Computation in Combinatorial Optimization Volume 5482 || Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms

✍ Cotta, Carlos; Cowling, Peter 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 270 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 2204 || Complexity of Coloring Graphs without Forbidden Induced Subgraphs

✍ Brandstädt, Andreas; Le, Van Bang 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 151 KB

This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully