<--- Back to Details
First PageDocument Content
Morphisms / Line graph / Graph isomorphism / Graph / Connected component / Tree / Spanning tree / Matching / Graph coloring / Graph theory / Mathematics / Graph operations
Date: 2013-10-10 12:39:02
Morphisms
Line graph
Graph isomorphism
Graph
Connected component
Tree
Spanning tree
Matching
Graph coloring
Graph theory
Mathematics
Graph operations

syn_scale_density_query_time.eps

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 385,79 KB

Share Document on Facebook

Similar Documents

3. STRUCTURE MODEL AND ISOMORPHISM PROBLEM Structure model is also a canonical presentation of a graph. The problem of canonical presentation was established probably by Lazlo Babai [1, 2] in 1977th. It means the presen

DocID: 1vjcF - View Document

Chapter 68 Graph Isomorphism Testing without Numerics for Graphs of Bounded Eigenvalue Multiplicity

DocID: 1ugIx - View Document

Graph Isomorphism in Quasipolynomial Time L´aszl´o Babai University of Chicago arXiv:1512.03547v1 [cs.DS] 11 Dec 2015

DocID: 1syEg - View Document

Computational complexity theory / Theory of computation / Complexity classes / Graph isomorphism problem / NP / PP / Low / Graph automorphism / Hidden subgroup problem / Time complexity / P / Chromatic polynomial

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

DocID: 1rkqP - View Document

Theoretical computer science / Lance Fortnow / Probabilistic complexity theory / Carsten Lund / Computer science / IP / BPP / Probabilistically checkable proof / Symposium on Foundations of Computer Science / Mathematics

Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

DocID: 1rgOi - View Document