| Ihre Aktion | suchen [und] | ([PPN] Pica-Produktionsnummer) | | 1 Treffer |
 |
PPN: |
|
Titel: |
||
Verfasser: |
||
Ort/Jahr: |
Burlington : Elsevier Science, 2014 |
|
Sprache/n: |
Englisch |
|
Umfang: |
Online-Ressource (344 p) |
|
Anmerkung: |
Description based upon print version of record |
|
Mehr zum Titel: |
Front Cover; Graph Theory and Computing; Copyright Page; Table of Contents; LIST OF CONTRIBUTORS; PREFACE; CHAPTER 1. ALTERNATING CHAIN METHODS: A SURVEY; 1. Historical Background; 2. The Maximum Matching Problem; 3. The Maximum c-Matching Problem; 4. The Maximum Stable Set Problem; References; CHAPTER 2. THE AVERAGE HEIGHT OF PLANTED PLANE TREES; References; CHAPTER 3. HOW TO NUMBER A GRAPH; 1. A Statement of the Problem; 2. A Context for the Problem; 3. A History of Subproblems; 4. Necessary Conditions for Graceful Graphs; 5. Classes of Graceful Graphs; 6. Some General Questions
7. Euclidean Models and Complete Graphs8. Numbered Graphs and Difference Sets; 9. Summary of Unsolved Problems; 10. Postscript; Acknowledgments; CHAPTER 4. EVOLUTION OF THE PATH NUMBER OF A GRAPH: COVERING AND PACKING IN GRAPHS, II; 1. History; 2. Results on the Path Number; 3. The Unrestricted Path Number; 4. Unsolved Problems; References; CHAPTER 5.THE PRODUCTION OF GRAPHS BY COMPUTER; 1. Introduction; 2. Definitions and Terminology; 3. Problems; 4. Representation and Identification of Graphs in a Computer; 5. Production of Simple Graphs; 6. Production of Star Topologies
7. Production of Stars Having a Given TopologyReferences; CHAPTER 6. A GRAPH-THEORETIC PROGRAMMING LANGUAGE; 1. Introduction; 2. Design Considerations; 3. FORTRAN Characteristics of GTPL; 4. The Graph-Theoretical Statements of GTPL; 5. Notes on Graph Theory Algorithms; 6. Sample Programs; 7. Concluding Remarks; References; CHAPTER 7. ENTROPY OF TRANSFORMED FINITE-STATE AUTOMATA AND ASSOCIATED LANGUAGES; 1. Introduction; 2. Preliminaries; 3. S Transformation of Automata; 4. Entropy of S-Transformed Automata; References; CHAPTER 8. COUNTING HEXAGONAL AND TRIANGULAR POLYOMINOES; 1. Introduction
2. Bounding Hexagons3. Symmetries; 4. Counting Algorithm; 5. Performance, Results, and Omissions; 6. Asymptotic Behavior; References; CHAPTER 9. SYMMETRY OF CUBICAL AND GENERAL POLYOMINOES; 1. Hypercubic Polyominoes and Their Symmetry; 2. The Hyperoctahedral Group Od; 3. The Existence of Models; 4. Cubical Counts; References; CHAPTER 10.GRAPH COLORING ALGORITHMS; 1. Introduction; 2. Sequential Vertex Colorings; 3. 5 Coloring Planar Graphs; 4. Coloring Random Graphs; References; CHAPTER 11. ALGEBRAIC ISOMORPHISM INVARIANTS FOR GRAPHS OF AUTOMATA; 1. Introduction
2. Finite Automata and Transition Graphs3. Algebraic Isomorphism Invariants; 4. Disconnected Graphs and Elementary Divisors; 5. Permutation Graphs; 6. Forests; 7. Arbitrary Transition Graphs; References; CHAPTER 12. THE CODING OF VARIOUS KINDS OF UNLABELED TREES; 1. Introduction: Coding in General; 2. Definitions; 3. Binary Codes for Planted Plane Trees; 4. Binary Codes for Plane Rooted Trees; 5. Binary Codes for Rooted Trees; 6. The Decoding Algorithm; 7. Binary Codes for Unrooted Trees; 8. A Streamlined Algorithm for Coding Unrooted Trees; 9. Some Properties of Tree Codes
10. Canonical Labelings
|
|
Bibliogr. Zusammenhang: |
Print version: Graph Theory and Computing |
|
ISBN: |
978-1-4832-3187-7
978-1-4832-6312-0
|
|
Schlagwörter: |
||
Klassifikation: |
Library of Congress Classification: QA166 .R4 2014
Dewey Decimal Classification: 511.5
|
|
|
Inhalt:
|
Graph Theory and Computing
|
|
Links zum Titel:
|
|
Produktsigel: |
ZDB-30-PQE |
