Messmer, B.T., and Bunke, H. "Subgraph isomorphism in polynomial time," 1995. Technical Report TR-IAM-95-003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Studies on the Uses and Usefulness of Diagrams - Berger (2000) (Correct)
....follows from an approach which minimizes known data organization. There are other approaches: There is the above mentioned idea to rely on compartments of knowledge to reduce the relevant structures to size manageable by exponential algorithms; a di erent approach allows Messmer and Bunke [MB95] to solve the subgraph isomorphism problem in time polynomial in the size of the embedded graph, with the help of intensive pre processing of the other graph (they build decision trees which may grow exponential in its size) An approach based on preprocessing established knowledge for fast ....
B.T. Messmer and H. Bunke. Subgraph isomorphism in polynomial time. Technischer Bericht IAM 95-003, Institut fur Informatik, Universitat Bern, Schweiz, 1995. 59
Comparing Simplification Procedures for Decision Trees on an.. - Aha, Breslow (1998) (3 citations) (Correct)
....synthesis tasks (e.g. problem solving, planning) and in using more expressive case representations. Towards these goals, one of our next research objectives is to see how these tree simplification algorithms compare in the context of graph structured case representations. In this context, Messmer and Bunke (1995) have recently developed an algorithm that solves a constrained subgraph isomorphism problem in polynomial time, after first generating a decision tree whose size is exponential in the size of the graphstructured cases. Although the authors introduced two methods for pruning their decision trees ....
Messmer, B.T. and H. Bunke (1995), "Subgraph Isomorphism in Polynomial Time," Technical Report IAM 95-003, University of Bern, Institute of Computer Science and Applied Mathematics, Bern, Switzerland.
Fast Error-correcting Graph Isomorphism Based on Model.. - Messmer, Bunke (1996) (6 citations) Self-citation (Messmer Bunke) (Correct)
....of the input graph. In particular, the time complexity of the new method is completely independent of the number of model graphs in the database. The new algorithm is an extension of the method for exact subgraph isomorphism detection that was previously presented by the authors in [MB95b, MB95c] It is based on the idea of generating all possible adjacency matrices of a model graph off line and organizing them in a decision tree. At run time, the decision tree is used to classify the adjacency matrix of an unknown input graph. In the case of exact graph isomorphism detection, the ....
....second approach, the error corrections are considered at run time only. That is, the decision tree for a set of model graphs does not incorporate any information about possible errors. Hence, the decision tree compilation step is identical to the original preprocessing step presented in [MB95b, MB95c] and, consequently, the size of the decision tree is exponential only in the size of the model graphs. At run time, a set of distorted copies of the input graph are constructed such that all possible error corrections up to a certain error threshold are considered. Each graph in this set is then ....
[Article contains additional citation context not shown here]
B.T. Messmer and H. Bunke. Subgraph isomorphism in polynomial time. Technical Report IAM-95-003, University of Bern, 1995.
A CBR Approach to Asymmetric Plan Detection - Fu, Remolina, Eilbert (2003) (1 citation) (Correct)
No context found.
Messmer, B.T., and Bunke, H. "Subgraph isomorphism in polynomial time," 1995. Technical Report TR-IAM-95-003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC