H.B. Mittal: "A fast backtrack algorithm for graph isomorphism", Info. Process. Lett., Vol. 29, No. 2, pp. 105-110, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Better Verification Through Symmetry - Ip, Dill (1996) (96 citations) (Correct)
.... algorithms, using a simple exponential time canonicalization function for symmetry reduced verification often results in significantly increased time, even when there are vast reductions in the number of states explored [ID93a, ID93b] However, many heuristics for testing graph isomorphism [Ebe88, Mit88] are also applicable in our problem. Using some of these heuristics results in a much faster algorithm. We are currently obtaining speedups of up to 98 . In some extreme cases when the heuristics for graph isomorphism are not fast enough, we can also make use of the following observation: Lemma ....
Hari Ballabh Mittal, A Fast Backtrack Algorithm for Graph Isomorphism, Information Processing Letters 29, pp. 105-110, 1988.
Automatic Comparison of Execution Histories in the Debugging of.. - Han (1999) (1 citation) (Correct)
.... a POET execution history as a directed graph and then treat the comparison problem as a graph isomorphism problem (GIA) Two graphs G 1 and G 2 are said to be isomorphic if there exists a oneto one correspondence between their vertices and edges such that the incidence relationship is preserved [17]. The execution history obtained by POET can be treated as a directed acyclic graph 1 in which vertices denote events and there is a directed edge from vertex u to vertex v iff 1 This is similar, but not identical, to the standard graph representation of the partial order of execution. In this ....
....edge than graph B, but their canonical labelings are completely different. 3.3. UNGER S ALGORITHM 35 3.3 Unger s Algorithm A heuristic program for testing graph isomorphism was first developed by S. H. Unger [24] in 1963, and then was successively modified by D. C. Schmidt [18] H. B. Mittal [17], and others. 3.3.1 Terminology We use the terminology defined by Unger et al. ffl The degree sequence of a graph is a listing of the degrees of vertices of the graph. For a directed graph, the indegree and outdegree sequences are defined similarly. ffl Vertices having the same characteristic ....
Hari B. Mittal. A fast backtrack algorithm for graph isomorphism. In 1988 Information Processing Letters 29, pages 105--110, North-Holland, 1988. BIBLIOGRAPHY 115
Informe Tcnico - Di Region-Based Correspondence (Correct)
No context found.
H.B. Mittal: "A fast backtrack algorithm for graph isomorphism", Info. Process. Lett., Vol. 29, No. 2, pp. 105-110, 1988.
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