A dynamical systems approach to weighted graph matching

DOI10.1016/j.automatica.2008.04.009zbMath1204.05084WikidataQ57581879 ScholiaQ57581879MaRDI QIDQ2377984

Michael M. Zavlanos, George J. Pappas

Publication date: 20 January 2009

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2008.04.009

zbMATH Keywords

graph matching; orthogonal matrices; isomorphic graphs; differential flows

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Partial retrieval of CAD models based on the gradient flows in Lie group, An algorithm for weighted sub-graph matching based on gradient flows, Continuous relaxations for the traveling salesman problem, Topological learning for brain networks

Cites Work

• Least squares matching problems
• Double bracket equations and geodesic flows on symmetric spaces
• Connectivity graphs as models of local interactions
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
• Matrix Analysis
• An eigendecomposition approach to weighted graph matching problems
• Matrix differential equations: a continuous realization process for linear algebra problems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• On State-dependent dynamic graphs and their controllability properties
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• Flocking in Fixed and Switching Networks
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item