PARTITIONING GRAPH MATCHING WITH CONSTRAINTS

被引：5
|
作者：
BLAKE, RE
机构：
[1] Department of Computer Systems and Telematics, University of Trondheim-NTH
来源：
PATTERN RECOGNITION | 1994年 / 27卷 / 03期
关键词：
GRAPH MATCHING; COMPUTER VISION; INFERENCE; LATTICE THEORY;
D O I：
10.1016/0031-3203(94)90120-1
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The partitioning of the graph matching problem into sub-problems under the control of constraints is considered. Scott lattice theory is suggested as a basis and the essential requirements on the data types and algorithms are stated. An example lattice of constraints is shown and a matching algorithm that partitions the matching problem is illustrated with an example.
引用
下载
收藏
页码：439 / 446
页数：8
相关论文
共 50 条
  • [1] Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation
    Xu, Haoyan
    Duan, Ziheng
    Wang, Yueyang
    Feng, Jie
    Chen, Runjian
    Zhang, Qianru
    Xu, Zhongbin
    NEUROCOMPUTING, 2021, 439 : 348 - 362
  • [2] Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs
    Castonguay, Diane
    Coelho, Erika M. M.
    Coelho, Hebert
    Nascimento, Julliano R.
    Souza, Ueverton S.
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 257 - 269
  • [3] Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
    Bassa, A.
    Burns, J.
    Campbell, J.
    Deshpande, A.
    Farley, J.
    Halsey, M.
    Ho, S. -Y.
    Kleitman, D.
    Michalakis, S.
    Persson, P. -O.
    Pylyavskyy, P.
    Rademacher, L.
    Riehl, A.
    Rios, M.
    Samuel, J.
    Tenner, B. E.
    Vijayasarathy, A.
    Zhao, L.
    STUDIES IN APPLIED MATHEMATICS, 2010, 124 (03) : 213 - 228
  • [4] Partitioning edges of a planar graph into linear forests and a matching
    Bonamy, Marthe
    Czyzewska, Jadwiga
    Kowalik, Lukasz
    Pilipczuk, Michal
    JOURNAL OF GRAPH THEORY, 2023, 104 (03) : 659 - 677
  • [5] EXTENDING SQL WITH GRAPH MATCHING, SET COVERING AND PARTITIONING
    HORNG, JT
    LIU, BJ
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 1994, 17 (01) : 13 - 30
  • [6] Graph matching constraints for synthesis with complex components
    Martinez, Ana Fuentes
    Kuchcinski, Krzysztof
    DSD 2007: 10TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN ARCHITECTURES, METHODS AND TOOLS, PROCEEDINGS, 2007, : 288 - 295
  • [7] Parallel Greedy Graph Matching using an Edge Partitioning Approach
    Patwary, Md. Mostofa Ali
    Bisseling, Rob H.
    Manne, Fredrik
    HLPP 2010: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON HIGH-LEVEL PARALLEL PROGRAMMING AND APPLICATIONS, 2010, : 45 - 54
  • [8] Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
    Xu, Hongteng
    Luo, Dixin
    Carin, Lawrence
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [9] Integrating Graph Partitioning and Matching for Trajectory Analysis in Video Surveillance
    Lin, Liang
    Lu, Yongyi
    Pan, Yan
    Chen, Xiaowu
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (12) : 4844 - 4857
  • [10] Quality matching and local improvement for multilevel graph-partitioning
    Monien, B
    Preis, R
    Diekmann, R
    PARALLEL COMPUTING, 2000, 26 (12) : 1609 - 1634
12345