Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 125-141
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Polynomial algorithms for open plane graph and subgraph isomorphismsTheoretical Computer Science, 2013
- Polynomial algorithms for subisomorphism of nD open combinatorial mapsComputer Vision and Image Understanding, 2011
- CP Models for Maximum Common Subgraph Problems2011
- Isomorphism Testing via Polynomial-Time Graph ExtensionsJournal of Mathematical Modelling and Algorithms, 2010
- AllDifferent-based filtering for subgraph isomorphismArtificial Intelligence, 2010
- Efficient algorithms for singleton arc consistencyConstraints, 2009
- Solving subgraph isomorphism problems with constraint programmingConstraints, 2009
- Constraint Networks2009
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- Relational consistency algorithms and their application in finding subgraph and graph isomorphismsInformation Sciences, 1979