Algorithmic Graph Theory and Perfect Graphs.

Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic n...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Rheinboldt, Werner
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Elsevier Science, 2014.
Temas:
Perfect graphs.
Graphes parfaits.
Perfect graphs
Acceso en línea:Texto completo

MARC

LEADER 00000cam a22000007a 4500
001 EBOOKCENTRAL_ocn898327016
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|||||||||
008 141219s2014 xx o 000 0 eng d
040 |a IDEBK  |b eng  |e pn  |c IDEBK  |d EBLCP  |d DEBSZ  |d DEBBG  |d OCLCQ  |d MERUC  |d OCLCQ  |d AU@  |d OCLCQ  |d REDDC  |d OCLCF  |d K6U  |d OCLCQ  |d OCLCO  |d OCLCL 
020 |a 1322477655  |q (ebk) 
020 |a 9781322477657  |q (ebk) 
020 |a 9781483271972 
020 |a 1483271978 
029 1 |a AU@  |b 000062381333 
029 1 |a DEBBG  |b BV042990331 
029 1 |a DEBBG  |b BV043615454 
029 1 |a DEBSZ  |b 446069078 
035 |a (OCoLC)898327016 
037 |a 679047  |b MIL 
050 4 |a QA166  |b G64 1980eb 
082 0 4 |a 511/.5 
049 |a UAMI 
100 1 |a Rheinboldt, Werner. 
245 1 0 |a Algorithmic Graph Theory and Perfect Graphs. 
260 |b Elsevier Science,  |c 2014. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
588 0 |a Print version record. 
505 0 |a Front Cover; Algorithmic Graph Theory and Perfect Graphs; Copyright Page; Table of Contents; Dedication; 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. 
505 8 |a 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. 
505 8 |a 7. Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated GraphsExercises; Bibliography; Chapter 5. Comparability Graphs; 1. D-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 D*-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. 
505 8 |a 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. 
505 8 |a 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. 
520 |a Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect g. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Perfect graphs. 
650 6 |a Graphes parfaits. 
650 7 |a Perfect graphs  |2 fast 
758 |i has work:  |a Algorithmic graph theory and perfect graphs (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCFWTcQbDR43McmPtP9Jfmb  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Erscheint auch als:  |n Druck-Ausgabe  |t Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1888440  |z Texto completo 
936 |a BATCHLOAD 
938 |a EBL - Ebook Library  |b EBLB  |n EBL1888440 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n cis30361069 
994 |a 92  |b IZTAP 

Ejemplares similares