A two-stage discrete optimization method for largest common subgraph problems

IEICE Transactions on Information and Systems

Volumn E82-D, Issue 8, 1999, Pages 1145-1153

  Funabiki, Nobuo ^a   Kitamichi, Junji ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Common subgraph; Discrete descent method; Greedy method; Isomorphic; NP complete; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

LARGEST COMMON SUBGRAPH PROBLEMS (LCSP); TWO-STAGE DISCRETE OPTIMIZATION METHODS;

OPTIMIZATION;

EID: 0032597935     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, 1979.
2. N. Ansari and E. Hou, Computational intelligence for optimization, Kluwer Academic Publishers, 1997.
3. G. Reinelt, The traveling salesman: Computational solutions for TSP applications, Lect. Note. Comput. Science, Springer-Verlag, 1994.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, The MIT Press, 1989.
5. J.J. McGregor, Backtrack search algorithms and the maximal common subgraph problem, Softw. Pract. and Exp., vol.12, pp.23-34, 1982.
6. E. Mjolsness and C. Garrett, Algebraic transformation of objective functions, Neural Networks, vol.3, pp.G51-GG9, 1990.
7. A. Shoukry and M. Aboutabl, Neural network approach for solving the maximal common subgraph problem, IEEE Trans. Syst., Man, fc Cybern., vol.2G, no.5, pp.785-790, Oct. 1990.
8. N.M. Nasrabadi and W. Li, Object recognition by a Hopfield neural network, IEEE Trans. Syst., Man, & Cybern., vol.21, no.G, pp.1523-1535, Nov./Dcc. 1991.
9. S.T. Barnard and W.B. Thompson, Disparity analysis of images, IEEE Trans. Pattern Anal, fc Machine Intell., vol.PAMI-2, no.4, pp.333-340, July 1980.
10. L.G. Shapiro and R.M. Haralick, A metric for comparing relational descriptions, IEEE Trans. Pattern Anal. & Machine Intell., vol.PAMI-7, no.l, pp.90-94, Jan. 1985.
11. A. Sanfeliu and K.-S. Pu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst., Man, & Cybern., vol.SMC-13, no.3, pp.353362, May/June 1983.
12. L.S. Davis, Shape matching using relaxation techniques, IEEE Trans. Pattern Anal. & Machine Intell., vol.PAMI-1, no.l, pp.GO-72, Jan. 1979.
13. \V.J. Masek and M.S. Paterson, A faster algorithm computing string edit distances, J. Comput. Syst. Sei., vol.20, pp.18-31, 1980.
14. N. Sherwani, Algorithms for VLSI physical design automation, Kluwer Academic Publishers, 1995.
15. M. Sarrafzadeh and C.K. \Vong, An introduction to VLSI physical design, McGraw-Hill, 199G.
16. Y. Yamada, E. Tomita, and H. Takahashi, A randomized algorithm for finding a near-maximum clique and its experimental evaluations, IEICE Trans., vol.J76-D-I, no.2, pp.46-53, Feb. 1993.
17. N. Funabiki, J. Kitamichi, and S. Nishikawa, An evolutionary neural network algorithm for max cut problems, Proc. Int. Conf. Neural Networks, pp.1260-1265, June 1997.
18. M. Gendreau, P. Soriano, and L. Salvail, Solving the maximum clique problem using a tabu search approach, Ann. Opcr. Research, vol.41, pp.385-403, 1993.
19. N. Funabiki and S. Nishikawa, Comparisons of energydescent optimization algorithms for maximum clique problems, IEICE Trans. Fundamentals, \-ol.E79-A, no.4, pp.452-460, April 1996.
20. A.A. Bertossi and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans. Networking, vol.3, no.4, pp.441-449, Aug. 1995.