Sciweavers

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

10

MICS
2008

favoriteEmaildiscussreport

107views more MICS 2008»

Automatic Proof of Graph Nonisomorphism

13 years 4 months ago

Automatic Proof of Graph Nonisomorphism

Download www.maths.usyd.edu.au

We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental implementation of an interactive webpage producing a proof of (non)isomorphism when given two graphs. Mathematics Subject Classification (2000). 05C60, 68R10, 05C25, 03B35. Keywords. Graphs, groups, graph isomorphism, automatic proof generation.

Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murra

Real-time Traffic

Automatic Proof Generation | Mathematics Subject Classification | MICS 2008 | Nonisomorphism Proofs |

claim paper

Related Content

» Automated Termination Proofs for Java Programs with Cyclic Data

» Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves

» GraphBased Proof Counting and Enumeration with Applications for Program Fragment Synthesis

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Interactive Termination Proofs Using Termination Cores

» Improving the Contextsensitive Dependency Graph

» Midlet Navigation Graphs in JML

» Dense and Switched Modular Primitives for Bond Graph Model Design

» Actor Garbage Collection Using VertexPreserving ActortoObject Graph Transformations

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	MICS
Authors	Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murray

Comments (0)