Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CORR
2008
Springer

favoriteEmaildiscussreport

123views Education» more CORR 2008»

On the graph isomorphism problem

13 years 4 months ago

On the graph isomorphism problem

Download www2.math.uic.edu

We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05. Keywords and phrases: graph isomorphism, subgraph isomorphism, tensor products, doubly stochastic matrices, ellipsoidal algorithm.

Shmuel Friedland

Real-time Traffic

CORR 2008 | Education | Graph Isomorphism | Graph Isomorphism Problem | Mathematics Subject Classification |

claim paper

Related Content

» On the Complexity of Matroid Isomorphism Problem

» The Isomorphism Problem for Planar 3Connected Graphs is in Unambiguous Logspace

» Subgraph Isomorphism in Planar Graphs and Related Problems

» On the Complexity of Matroid Isomorphism Problems

» Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs

» Complexity of Ring Morphism Problems

» Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Proce...

» Ant Algorithm for the Graph Matching Problem

» Hardness Results for Tournament Isomorphism and Automorphism

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Shmuel Friedland

Comments (0)