Amanote Research
Register
Sign In
Bounded Color Multiplicity Graph Isomorphism Is in the #L Hierarchy
doi 10.1109/ccc.2005.7
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
V. Arvind
P.P. Kurur
T.C. Vijayaraghavan
Publisher
IEEE
Related search
Group, Graphs, Algorithms: The Graph Isomorphism Problem
Fast Algorithm for Graph Isomorphism Testing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Isomorphism and Morita Equivalence of Graph Algebras
Transactions of the American Mathematical Society
Mathematics
Applied Mathematics
The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases
Journal of Artificial Intelligence Research
Artificial Intelligence
Use of Eigenvector Centrality to Detect Graph Isomorphism
Graph Ramsey Theory and the Polynomial Hierarchy
Subtree Isomorphism Is in Random NC
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Graph Isomorphism Algorithm Using Pieces Patching Puzzle Technique (Ppp - Technique)
International Journal of Computer Applications
