Filtering for Subgraph Isomorphism (Q3523085)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Filtering for Subgraph Isomorphism	scientific article

Statements

scholarly article

0 references

Filtering for Subgraph Isomorphism (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-540-74970-7_51

0 references

Principles and Practice of Constraint Programming – CP 2007

0 references

publication date

2 September 2008

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-74970-7_51

0 references

0 references

0 references

An Algorithm for Subgraph Isomorphism

0 references

Constraint satisfaction algorithms for graph pattern matching

0 references

0 references

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

0 references

Filtering for Subgraph Isomorphism

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

CP(Graph): Introducing a Graph Computation Domain in Constraint Programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3523085

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