Group-theoretic Algorithms and Graph Isomorphism
Author : Christoph Martin Hoffmann
Publisher : Springer
Page : 328 pages
File Size : 16,37 MB
Release : 1982
Category : Mathematics
ISBN :
Author : Christoph Martin Hoffmann
Publisher : Springer
Page : 328 pages
File Size : 16,37 MB
Release : 1982
Category : Mathematics
ISBN :
Author : C. M. Hoffmann
Publisher :
Page : 324 pages
File Size : 21,2 MB
Release : 2014-01-15
Category :
ISBN : 9783662201435
Author : Christoph M. Hoffmann
Publisher :
Page : 311 pages
File Size : 42,33 MB
Release : 1982
Category :
ISBN :
Author : J. Kobler
Publisher : Springer Science & Business Media
Page : 168 pages
File Size : 21,73 MB
Release : 2012-12-06
Category : Computers
ISBN : 1461203333
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, and also, to give the reader an understanding of the aims and topics in Structural Complexity Theory, in general. The text is basically self contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. It can be used to teach a seminar or a monographic graduate course, but also parts of it (especially Chapter 1) provide a source of examples for a standard graduate course on Complexity Theory. Many people have helped us in different ways III the process of writing this book. Especially, we would like to thank V. Arvind, R.V. Book, E. May ordomo, and the referee who gave very constructive comments. This book project was especially made possible by a DAAD grant in the "Acciones In tegrada" program. The third author has been supported by the ESPRIT project ALCOM-II.
Author : Ashay Dharwadker
Publisher : Institute of Mathematics
Page : 42 pages
File Size : 22,74 MB
Release : 2009-08-08
Category : Mathematics
ISBN : 1466394374
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary and sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We prove that the canonical form of the sign matrix is uniquely identifiable in polynomial-time for isomorphic graphs. The algorithm is demonstrated by solving the Graph Isomorphism Problem for many of the hardest known examples. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.
Author : Derek F. Holt
Publisher : CRC Press
Page : 532 pages
File Size : 46,1 MB
Release : 2005-01-13
Category : Mathematics
ISBN : 1420035215
The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundame
Author : Ákos Seress
Publisher : Cambridge University Press
Page : 292 pages
File Size : 12,16 MB
Release : 2003-03-17
Category : Mathematics
ISBN : 9780521661034
Table of contents
Author : Ming-Yang Kao
Publisher : Springer Science & Business Media
Page : 1200 pages
File Size : 15,60 MB
Release : 2008-08-06
Category : Computers
ISBN : 0387307702
One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
Author : Johannes Köbler
Publisher :
Page : 160 pages
File Size : 16,62 MB
Release : 1993-01-01
Category : Complexité de calcul (Informatique)
ISBN : 9783764336806
"The graph isomorphism problem belongs to the part of Complexity Theory that focuses on the structure of complexity classes involved in the classification of computational problems and in the relations among them. It consists in deciding whether two given graphs are isomorphic, i.e. whether there is a bijective mapping from the nodes of one graph to the nodes of the second graph such that the edge connections are respected. It is a problem of considerable practical as wen as theoretical importance that is, as of now, unresolved in the sense that no efficient algorithm for it has yet been found. Given this fact, it is natural to ask whether such an algorithm exists at an or whether the problem is intractable. -Be book focuses on this issue and presents several recent results that provide a better understanding of the relative position of the graph isomorphism problem in the class NP as well as in other complexity classes. It also uses the problem to illustrate important concepts in structural complexity, providing a look into the more general theory. 'The book is basically self-contained; the only prerequisite for reading it is some elementary knowledge from Complexity Theory and Probability Theory. Its level of presentation makes it eminently suitable for a seminar or graduate course devoted to the problem, or as a rich source of examples for a standard graduate course in Complexity Theory." -- Book cover.
Author : Michel Gondran
Publisher :
Page : 680 pages
File Size : 50,69 MB
Release : 1984-03-22
Category : Mathematics
ISBN :
Generalities about graphs. The shortest path problem in a graph. Path algebras. Trees and arborescences. Flows and transportation networks. Flows with gains. Multicommodity flows. Matchings and b-matchings. Eulerian and hamiltonian walks. Matroids. Non-polynomial problems. Branch and bound algorithms. Approximate algorithms. Linear programming. Integer linear programming. Lagrangean relaxation and solving the dual problem. Dynamic programming. Minimum ratio problems.