Graph-Based Representations in Pattern Recognition

DOI10.1007/B107037MaRDI QIDQ5316491zbMATH OpenOpenAlexFDO

Authors Hang Yu, Edwin R. Hancock

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107037

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45)

Recommendations

• scientific article; zbMATH DE number 1182569
• Semidefinite programming relaxations for the graph partitioning problem
• Graph partitioning using linear and semidefinite programming
• Solving Graph Bisection Problems with Semidefinite Programming
• An efficient semidefinite programming relaxation for the graph partition problem
• The real positive semidefinite completion problem for series-parallel graphs
• Semidefinite programming and eigenvalue bounds for the graph partition problem
• Semidefinite programming in combinatorial optimization
• Subgraph Matching with Semidefinite Programming
• Parameterized graph separation problems

Cited in

(3)

• The seriation problem in the presence of a double Fiedler value
• Convex relaxations for permutation problems
• A convex relaxation bound for subgraph isomorphism

This page was built for publication: Graph-Based Representations in Pattern Recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316491)