Group-Theoretic Algorithms and Graph Isomorphism

✍ Scribed by Christoph M. Hoffmann (eds.)

Publisher: Springer-Verlag Berlin Heidelberg
Year: 1982
Tongue: English
Leaves: 320
Series: Lecture Notes in Computer Science 136
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Chapter I: Introduction....Pages 1-11
Chapter II: Basic concepts....Pages 12-59
Chapter III: Labelled graph automorphisms, cone graphs, and p-groups....Pages 60-113
Chapter IV: Isomorphisms of trivalent graphs and of cone graphs of degree two....Pages 114-177
Chapter V: Graphs of fixed valence and cone graphs of fixed degree....Pages 178-230
Chapter VI: Group-theoretic problems....Pages 231-272

✦ Subjects

Algorithm Analysis and Problem Complexity

📜 SIMILAR VOLUMES

Group-Theoretic Algorithms and Graph Iso

📁 Group-Theoretic Algorithms and Graph Isomorphism

✍ Christoph M. Hoffmann (eds.) 📂 Library 📅 1982 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Group-Theoretic Algorithms and Graph Iso

📁 Group-Theoretic Algorithms and Graph Isomorphism

✍ Christoph M. Hoffmann (eds.) 📂 Library 📅 1982 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Graphs and Algorithms

📁 Graphs and Algorithms

✍ Michel Gondran, Michel Minoux 📂 Library 📅 1984 🏛 John Wiley & Sons 🌐 English

Graphs and algorithms

📁 Graphs and algorithms

✍ Gondran M., Minoux M. 📂 Library 📅 1984 🏛 Wiley 🌐 English

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic (Eds.) 📂 Library 📅 2004 🏛 North Holland 🌐 English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra

📁 Algorithmic Graph Theory and Perfect Graphs

✍ Martin Charles Golumbic 📂 Library 📅 1980 🏛 Academic Press 🌐 English