Amanote Research

Amanote Research

    RegisterSign In

Fast Algorithm for Graph Isomorphism Testing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02011-7_21
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
José Luis López-PresaAntonio Fernández Anta
Publisher

Springer Berlin Heidelberg


Related search

Graph Isomorphism Algorithm Using Pieces Patching Puzzle Technique (Ppp - Technique)

International Journal of Computer Applications
2020English

A Fast Kernel-Based Multilevel Algorithm for Graph Clustering

2005English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Isomorphism and Morita Equivalence of Graph Algebras

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2011English

Group, Graphs, Algorithms: The Graph Isomorphism Problem

2019English

Use of Eigenvector Centrality to Detect Graph Isomorphism

2015English

When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

Median Graph Shift: A New Clustering Algorithm for Graph Domain

2010English

Bounded Color Multiplicity Graph Isomorphism Is in the #L Hierarchy

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy