Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic
| Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic |
| Autore | Golumbic Martin Charles |
| Pubbl/distr/stampa | New York, New York ; ; London, England : , : Academic Press, , 1980 |
| Descrizione fisica | 1 online resource (307 p.) |
| Disciplina | 511/.5 |
| Collana | Computer Science and Applied Mathematics |
| Soggetto topico | Perfect graphs |
| ISBN | 1-4832-7197-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Algorithmic Graph Theory and Perfect Graphs; Copyright Page; Dedication; Table of Contents; Foreword; Preface; Acknowledgments; List of Symbols; Chapter 1. Graph Theoretic Foundations ; 1. Basic Definitions and Notations; 2. Intersection Graphs; 3. Interval Graphs-A Sneak Preview of the Notions Coming Up; 4. Summary; Exercises; Bibliography; Chapter 2. The Design of Efficient Algorithms; 1. The Complexity of Computer Algorithms; 2. Data Structures; 3. How to Explore a Graph; 4. Transitive Tournaments and Topological Sorting; Exercises; Bibliography; Chapter 3. Perfect Graphs
1. The Star of the Show2. The Perfect Graph Theorem; 3. p-Critical and Partitionable Graphs; 4. A Polyhedral Characterization of Perfect Graphs; 5. A Polyhedral Characterization of p-Critical Graphs; 6. The Strong Perfect Graph Conjecture; Exercises; Bibliography; Chapter 4. Triangulated Graphs; 1. Introduction; 2. Characterizing Triangulated Graphs; 3. Recognizing Triangulated Graphs by Lexicographic Breadth-First Search; 4. The Complexity of Recognizing Triangulated Graphs; 5. Triangulated Graphs as Intersection Graphs; 6. Triangulated Graphs Are Perfect 7. Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated GraphsExercises; Bibliography; Chapter 5. Comparability Graphs; 1. Γ-Chains and Implication Classes; 2. Uniquely Partially Orderable Graphs; 3. The Number of Transitive Orientations; 4. Schemes and G-Decompositions-An Algorithm for Assigning Transitive Orientations; 5. The Γ*-Matroid of a Graph; 6. The Complexity of Comparability Graph Recognition; 7. Coloring and Other Problems on Comparability Graphs; 8. The Dimension of Partial Orders; Exercises; Bibliography; Chapter 6. Split Graphs 1. An Introduction to Chapters 6-8: Interval, Permutation, and Split Graphs2. Characterizing Split Graphs; 3. Degree Sequences and Split Graphs; Exercises; Bibliography; Chapter 7. Permutation Graphs; 1. Introduction; 2. Characterizing Permutation Graphs; 3. Permutation Labelings; 4. Applications; 5. Sorting a Permutation Using Queues in Parallel; Exercises; Bibliography; Chapter 8. Interval Graphs; 1. How It All Started; 2. Some Characterizations of Interval Graphs; 3. The Complexity of Consecutive 1's Testing; 4. Applications of Interval Graphs; 5. Preference and Indifference 6. Circular-Arc GraphsExercises; Bibliography; Chapter 9. Superperfect Graphs; 1. Coloring Weighted Graphs; 2. Superperfection; 3. An Infinite Class of Superperfect Noncomparability Graphs; 4. When Does Superperfect Equal Comparability?; 5. Composition of Superperfect Graphs; 6. A Representation Using the Consecutive 1's Property; Exercises; Bibliography; Chapter 10. Threshold Graphs; 1. The Threshold Dimension; 2. Degree Partition of Threshold Graphs; 3. A Characterization Using Permutations; 4. An Application to Synchronizing Parallel Processes; Exercises; Bibliography Chapter 11. Not So Perfect Graphs |
| Record Nr. | UNINA-9910786640403321 |
Golumbic Martin Charles
|
||
| New York, New York ; ; London, England : , : Academic Press, , 1980 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic
| Algorithmic graph theory and perfect graphs / / Martin Charles Golumbic |
| Autore | Golumbic Martin Charles |
| Pubbl/distr/stampa | New York, New York ; ; London, England : , : Academic Press, , 1980 |
| Descrizione fisica | 1 online resource (307 p.) |
| Disciplina | 511/.5 |
| Collana | Computer Science and Applied Mathematics |
| Soggetto topico | Perfect graphs |
| ISBN | 1-4832-7197-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Algorithmic Graph Theory and Perfect Graphs; Copyright Page; Dedication; Table of Contents; Foreword; Preface; Acknowledgments; List of Symbols; Chapter 1. Graph Theoretic Foundations ; 1. Basic Definitions and Notations; 2. Intersection Graphs; 3. Interval Graphs-A Sneak Preview of the Notions Coming Up; 4. Summary; Exercises; Bibliography; Chapter 2. The Design of Efficient Algorithms; 1. The Complexity of Computer Algorithms; 2. Data Structures; 3. How to Explore a Graph; 4. Transitive Tournaments and Topological Sorting; Exercises; Bibliography; Chapter 3. Perfect Graphs
1. The Star of the Show2. The Perfect Graph Theorem; 3. p-Critical and Partitionable Graphs; 4. A Polyhedral Characterization of Perfect Graphs; 5. A Polyhedral Characterization of p-Critical Graphs; 6. The Strong Perfect Graph Conjecture; Exercises; Bibliography; Chapter 4. Triangulated Graphs; 1. Introduction; 2. Characterizing Triangulated Graphs; 3. Recognizing Triangulated Graphs by Lexicographic Breadth-First Search; 4. The Complexity of Recognizing Triangulated Graphs; 5. Triangulated Graphs as Intersection Graphs; 6. Triangulated Graphs Are Perfect 7. Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated GraphsExercises; Bibliography; Chapter 5. Comparability Graphs; 1. Γ-Chains and Implication Classes; 2. Uniquely Partially Orderable Graphs; 3. The Number of Transitive Orientations; 4. Schemes and G-Decompositions-An Algorithm for Assigning Transitive Orientations; 5. The Γ*-Matroid of a Graph; 6. The Complexity of Comparability Graph Recognition; 7. Coloring and Other Problems on Comparability Graphs; 8. The Dimension of Partial Orders; Exercises; Bibliography; Chapter 6. Split Graphs 1. An Introduction to Chapters 6-8: Interval, Permutation, and Split Graphs2. Characterizing Split Graphs; 3. Degree Sequences and Split Graphs; Exercises; Bibliography; Chapter 7. Permutation Graphs; 1. Introduction; 2. Characterizing Permutation Graphs; 3. Permutation Labelings; 4. Applications; 5. Sorting a Permutation Using Queues in Parallel; Exercises; Bibliography; Chapter 8. Interval Graphs; 1. How It All Started; 2. Some Characterizations of Interval Graphs; 3. The Complexity of Consecutive 1's Testing; 4. Applications of Interval Graphs; 5. Preference and Indifference 6. Circular-Arc GraphsExercises; Bibliography; Chapter 9. Superperfect Graphs; 1. Coloring Weighted Graphs; 2. Superperfection; 3. An Infinite Class of Superperfect Noncomparability Graphs; 4. When Does Superperfect Equal Comparability?; 5. Composition of Superperfect Graphs; 6. A Representation Using the Consecutive 1's Property; Exercises; Bibliography; Chapter 10. Threshold Graphs; 1. The Threshold Dimension; 2. Degree Partition of Threshold Graphs; 3. A Characterization Using Permutations; 4. An Application to Synchronizing Parallel Processes; Exercises; Bibliography Chapter 11. Not So Perfect Graphs |
| Record Nr. | UNINA-9910811710303321 |
|
Golumbic Martin Charles
|
||
| New York, New York ; ; London, England : , : Academic Press, , 1980 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic graph theory and perfect graphs [e-book] / Martin Charles Golumbic
| Algorithmic graph theory and perfect graphs [e-book] / Martin Charles Golumbic |
| Autore | Golumbic, Martin Charles |
| Pubbl/distr/stampa | Amsterdam : Elsevier, 2004 |
| Descrizione fisica | xxvi, 314 p. : ill. ; 25 cm |
| Disciplina | 511.5 |
| Collana | Annals of discrete mathematics ; 57 |
| Soggetto topico | Perfect graphs |
| ISBN |
9780444515308
0444515305 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003271679707536 |
|
Golumbic, Martin Charles
|
||
| Amsterdam : Elsevier, 2004 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Algorithmic graph theory and perfect graphs / Martin Charles Golumbic
| Algorithmic graph theory and perfect graphs / Martin Charles Golumbic |
| Autore | Golumbic, Martin Charles |
| Pubbl/distr/stampa | New York : Academic Press, 1980 |
| Descrizione fisica | xx, 284 p. : ill. ; 24 cm. |
| Disciplina | 511.5 |
| Collana | Computer science and applied mathematics |
| Soggetto topico |
Graph algorithms
Perfect graphs |
| ISBN | 0122892607 |
| Classificazione |
AMS 05C85
QA166 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000668819707536 |
|
Golumbic, Martin Charles
|
||
| New York : Academic Press, 1980 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Massimo insieme stabile e grafi perfetti. Tesi di laurea / laureando Dario Cerasino ; relat. Paolo Nobili
| Massimo insieme stabile e grafi perfetti. Tesi di laurea / laureando Dario Cerasino ; relat. Paolo Nobili |
| Autore | Cerasino, Dario |
| Pubbl/distr/stampa | Lecce : Università del Salento. Facoltà di Scienze MM. FF. NN. Corso di laurea in Matematica, a.a. 2006-07 |
| Descrizione fisica | 73 p. ; 29 cm |
| Altri autori (Persone) | Nobili, Paolo |
| Soggetto topico |
Combinatorial optimization
Perfect graphs |
| Classificazione |
AMS 90C27
AMS 05C17 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNISALENTO-991002911509707536 |
|
Cerasino, Dario
|
||
| Lecce : Università del Salento. Facoltà di Scienze MM. FF. NN. Corso di laurea in Matematica, a.a. 2006-07 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Topics on perfect graphs / eds. C. Berge, V. Chvatal
| Topics on perfect graphs / eds. C. Berge, V. Chvatal |
| Autore | Berge, Claude |
| Pubbl/distr/stampa | Amsterdam ; New York : North-Holland, 1984 |
| Descrizione fisica | xiv, 369 p. : ill. ; 24 cm |
| Disciplina | 511.5 |
| Altri autori (Persone) | Chvatal, Valclav |
| Collana |
Annals of discrete mathematics ; 21
North-Holland mathematics studies, 0304-0208 ; 88 |
| Soggetto topico |
Combinatorics
Graph theory Perfect graphs |
| ISBN | 044486587X |
| Classificazione |
AMS 05-06
AMS 05-XX AMS 05C QA166.16.T66 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001447799707536 |
|
Berge, Claude
|
||
| Amsterdam ; New York : North-Holland, 1984 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Soggetto topico
-
Perfect graphs
(6)
- Combinatorial optimization (1)
- Combinatorics (1)
- Graph algorithms (1)
- Graph theory (1)