Combinatorial and matrix methods for graph matching

MaRDI QIDQ2705574zbMATH OpenFDO

Authors Cuiqin Lin

Publication date 22 March 2001

Published in Journal of Tsinghua University. Science and Technology (Search for Journal in Brave)

zbMATH Keywords

block designcombinatorial designmatching design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1844618
• Algorithms for approximate graph matching
• scientific article; zbMATH DE number 568824
• The graph matching problem
• Graph matching based on dot product representation of graphs
• Matching graphs
• Matching graphs by pivoting
• scientific article; zbMATH DE number 1471076

Cited in

(6)

• The existence of bimatching designs
• scientific article; zbMATH DE number 1501717 (Why is no real title available?)
• Graph unification and matching
• scientific article; zbMATH DE number 1844618 (Why is no real title available?)
• Graph matching with hierarchical discrete relaxation
• scientific article; zbMATH DE number 7626795 (Why is no real title available?)

This page was built for publication: Combinatorial and matrix methods for graph matching

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