A Linear Programming Approach for the Weighted Graph Matching Problem

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 15, Issue 5, 1993, Pages 522-525

  Almohamad, H A ^a   Duffuaa, S O ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

Graph matching; Hungarian method; linear programming; optimization; recognition; structural pattern

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING;

GRAPH MATCHING; PATTERN MATCHING; SIMPLEX ALGORITHMS; WEIGHTED GRAPHS;

PATTERN RECOGNITION;

EID: 0027593722     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.211474     Document Type: Article

References (12)

1. W. H. Tsai, and K. S. Fu, “Error-correcting isomorphisms of attributed relation graphs for pattern recognition,” IEEE Trans. Syst. Man Cybern., vol. SMC-9, pp. 757–768, Dec. 1979.
2. L. Kitchen, “Relaxation applied to matching quantitative relational structures,” IEEE Trans. Syst. Man Cybern., vol. SMC-10, pp. 96–101, Feb. 1980.
3. S. Umeyama, “An eigendecomposition approach to weighted graph matching problems,” IEEE Trans. Patt. Anal. Machine Intell., vol. 10, no. 5, pp. 695–703, Sept. 1988.
4. M. Garey and D. S. Johnson, Computer and Interactability: A guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1984.
5. M. You and A. K. C. Wong, “An algorithm for graph optimal isomorphism,” in Proc. ICPR. 1984, pp. 316–319.
6. L. Kitchen and A. Rosenfeld, “Discrete relaxation for matching relational structures,” IEEE Trans. Syst. Man Cybern., vol. SMC-9, pp. 869–864, Dec. 1979.
7. H. A. Almohamad, “A polynomial transform for matching pairs of weighted graphs,” 7. Applied Math. Modeling, vol. 15, no. 4, Apr. 1991.
8. M. Bazaraa, J. Jarvis, and H. Sherali, Linear Programming and Network Flows. New York: Wiley, 1990.
9. A. Charnes and W. W. Cooper, Management models and industrial applications of linear programming, Vol. 1. New York: Wiley, 1963.
10. C. C. Gonzaga, “An algorithm for solving linear programming programs in O(n3L) operation,” in Progress in Mathematical Programming, Interior Point and Related Methods (N. Megiddo, Ed.). New York: Springer-Verlag, 1988.
11. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithm and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
12. D. Dubois and H. Prade, Fuzzy Sets and Systems: Theory and Applications. New York: Academic, 1980.