Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker  Home/Search
Context Related
| dsi.unive.it/~pelillo/pa...tr994.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dsi.unive.it/~pelillo/T...techrep (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new (continuous) quadratic programming approach for graph- and tree-isomorphism problems which is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between... (Update)
Similar documents based on text: More All
0.6: Matching Hierarchical Structures Using Association Graphs - Pelillo, Siddiqi, Zucker (1998) (Correct)
0.5: Attributed Tree Matching and Maximum Weight Cliques - Pelillo, Siddiqi, Zucker (1999) (Correct)
0.5: Attributed Tree Homomorphism Using Association Graphs - Bartoli, Pelillo (2000) (Correct)
BibTeX entry: (Update)
M. Pelillo, K. Siddiqi, and S. W. Zucker. Continuous-based heuristics for graph and tree isomorphisms, with application to computer vision. In P. M. Pardalos, editor, Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer Academic Publishers, Boston, MA, 1999. In press. http://citeseer.ist.psu.edu/pelillo99continuousbased.html More
@misc{ pelillo99continuousbased,
author = "M. Pelillo and K. Siddiqi and S. Zucker",
title = "Continuous-based heuristics for graph and tree isomorphisms",
text = "M. Pelillo, K. Siddiqi, and S. W. Zucker. Continuous-based heuristics for
graph and tree isomorphisms, with application to computer vision. In P.
M. Pardalos, editor, Approximation and Complexity in Numerical Optimization:
Continuous and Discrete Problems. Kluwer Academic Publishers, Boston, MA,
1999. In press.",
year = "1999",
url = "citeseer.ist.psu.edu/pelillo99continuousbased.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
666 Design and Analysis of Spatial Data Structures (context) - Samet - 1990
474 Graph Theory (context) - Harary - 1969
403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1992
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
254 Neural computation of decisions in optimization problems (context) - Hopfield, Tank - 1985
164 Representation and recognition of the spatial organization o.. (context) - Marr, Nishihara - 1978
144 The NP-completeness column: An ongoing guide (context) - Johnson - 1988
109 An inequality with applications to statistical estimation fo.. (context) - Baum, Eagon - 1967
106 Evolutionary Game Theory (context) - Weibull - 1995
86 Shock graphs and shape matching - Siddiqi, Shokoufandeh et al. - 1998
84 A graduated assignment algorithm for graph matching - Gold, Rangarajan - 1996
76 The Theory of Evolution and Dynamical Systems (context) - Hofbauer, Sigmund - 1988
73 Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
39 The maximum clique problem - Bomze, Budinich et al. - 1999
[Article contains additional citations not shown here]
Documents on the same site (http://www.dsi.unive.it/~pelillo/TR/techrep.html): More
The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999) (Correct)
A Note on a Capacity Result for the Hopfield Neural Network - Pelillo (1999) (Correct)
Continuous-time Relaxation Labeling Processes - Torsello, Pelillo (1998) (Correct)
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