Efficient Suboptimal Graph Isomorphism (Q3637695): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 19:26, 1 July 2024

scientific article

Language	Label	Description	Also known as
English	Efficient Suboptimal Graph Isomorphism	scientific article

Statements

scholarly article

0 references

Efficient Suboptimal Graph Isomorphism (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-02124-4_13

0 references

0 references

Stefan Fankhauser

0 references

Peter J. C. Dickinson

0 references

0 references

Graph-Based Representations in Pattern Recognition

0 references

publication date

14 July 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02124-4_13

0 references

0 references

An Algorithm for Subgraph Isomorphism

0 references

0 references

Constraint satisfaction algorithms for graph pattern matching

0 references

0 references

A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

0 references

An eigendecomposition approach to weighted graph matching problems

0 references

0 references

0 references

0 references

Isomorphism of graphs of bounded valence can be tested in polynomial time

0 references

Matching graphs with unique node labels

0 references

A graph distance measure for image analysis

0 references

Algorithms for the Assignment and Transportation Problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3637695

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3637695&oldid=35117937"