A. T. Berztiss
Abstract
A reasonably efficient procedure for testing pairs of directed graphs for isomorphism is important in information retrieval and other application fields in which structured data have to be matched. One such procedure, a backtrack procedure based on a representation of directed graphs by linear formulas, is described. A procedure for finding a partial subdigraph of a digraph that is isomorphic to a given digraph is also described.
- 1 TURNER, J. Generahzed matrix functions and the graph isomorphmm problem. SIAM J. AppL Math. 16 (1968), 520-526.Google Scholar
- 2 SALTON, G , AND SUSSENGUTH, E.H. Some flexible reformation retrieval systems using structure matching procedures Proc AFIPS 1964 SJCC, Vol. 25, Spartan Books, New York, pp. 587-597Google Scholar
- 3 UNGER, S H. GIT--A heuristic program for testing pairs of directed hne graphs for isomorphism. Comm ACM 7, 1 (Jan 1964), 26-34. Google Scholar
- 4 STEEN, J P. Principle d'un algorlthme de recherche d'un lsomorphlsme entre deux graphes. Rev. Frang Inf. Rech. Opdratwnelle 8, No. R-3 (1969), 51---69.Google Scholar
- 5 CORNEIL, D G, AND GOTLIEB, C. C An efficient algorithm for graph isomorphism. J. ACM 17, 1 (Jan. 1970), 51--64. Google Scholar
- 6 CORNEAL, D. G. Graph Isomorphism. Ph.D. th., U. of Toronto, Toronto, Ontario, Canada, 1968.Google Scholar
- 7 KRIDER, L. A flow analysis algorithm J ACM 11, 4 (Oct 1964), 429---436. Google Scholar
- 8 BERZTISS, A. T , AND WATKINS, R.P. Directed graphs and automatic flowcharting. Proc. 4th Austral. Comp Conf., Adelaide, 1969, Griffin Press, Netley, South Australia, 1969, pp. 495- 499.Google Scholar
- 9 BERZTISS, A T. Data Structures: Theory and Practice. Academic Press, New York-London, 1971. Google Scholar
- 10 GOLOMB, S. W., AND BAUMERT, L. D Backtrack programming. J. ACM 1, 4 (Oct. 1965), 516-524. Google Scholar
- 11 FLOYD, R.W. Nondeterministlc algomthms J. ACM 14, 4 (Oct. 1967), 636--644. Google Scholar
- 12 NAsH-WILLIAMS, C. ST J.A. Hamiltoman circuits in graphs and digraphs In The Many Facets of Graph Theory, G. Chartrand and S. F. Kapoor (Eds ), Sprmger-Verlag, Berhn-Heldelberg- New York, 1969, pp 237-243.Google Scholar
- 13 KROLAK, P., FELTS, W., AND MARBLE, G. A man-machine approach toward solving the traveling salesman problem. Comm. ACM 14, 5 (May 1971), 327-334.F Google Scholar
Index Terms
- A Backtrack Procedure for Isomorphism of Directed Graphs
Recommendations
Directed Path-Width and Directed Tree-Width of Directed Co-graphs
Computing and CombinatoricsAbstractIn this paper we consider the directed path-width and directed tree-width of directed co-graphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint union, series ...
Isomorphism between Cayley (di)graphs
Let @C and @D be finite groups. We give a sufficient condition to prove that every Cayley graph of @C is isomorphic to a Cayley graph of @D. As an application of this result, it is proved that every Cayley graph of a certain group of order 12 is ...
Directed domination in oriented graphs
A directed dominating set in a directed graph D is a set S of vertices of V such that every vertex u@?V(D)@?S has an adjacent vertex v in S with v directed to u. The directed domination number of D, denoted by @c(D), is the minimum cardinality of a ...
Comments