Boolean matching algorithm based on the perfect matching of the bipartite graph

被引：0
|
作者：
Lu, ZW [1 ]
Lin, ZH [1 ]
Lei, Z [1 ]
机构：
[1] Shanghai Jiao Tong Univ, LSI Res Inst, Shanghai 200030, Peoples R China
来源：
2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS | 2001年
关键词：
Boolean matching; technology mapping; logic synthesis; graph theory; electronic design automation;
D O I：
10.1109/ICASIC.2001.982519
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents an improved Boolean matching algorithm based on the perfect matching of the bipartite graph. By transforming the mapping between Boolean variables into the problem of the perfect matching of the bipartite graph, this improved algorithm can overcome the shortcoming of the original algorithm, i.e., lengthy computation time caused by the excessive mapping terms. It is shown through the experimental results on MCNC benchmarks that the improved algorithm can reduce the computation time by about 21% compared to the original algorithm. Also, the concept of the strongly mapping between Boolean variables is presented, which is the generalization of the conventional Boolean variable mapping.
引用
收藏
页码：150 / 154
页数：5
相关论文
共 50 条
  • [1] Boolean mapping algorithm based on perfect matching of bipartite graph
    Lu, Z.-W.
    Lin, Z.-H.
    Zhang, L.
    [J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2001, 13 (11): : 961 - 965
  • [2] A PERFECT MATCHING ALGORITHM FOR SPARSE BIPARTITE GRAPHS
    TOCZYLOWSKI, E
    [J]. DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 263 - 268
  • [3] A Deterministic Parallel Algorithm for Bipartite Perfect Matching
    Fenner, Stephen
    Gurjar, Rohit
    Thierauf, Thomas
    [J]. COMMUNICATIONS OF THE ACM, 2019, 62 (03) : 109 - 115
  • [4] Perfect matching in bipartite hypergraphs subject to a demand graph
    Lior Aronshtam
    Hagai Ilani
    Elad Shufan
    [J]. Annals of Operations Research, 2023, 321 : 39 - 48
  • [5] Best odds for finding a perfect matching in a bipartite graph
    Paulsen, W.
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (05): : 753 - 763
  • [6] Codes parameterized by the edges of a bipartite graph with a perfect matching
    Sarabia, Manuel Gonzalez
    Villarreal, Rafael H.
    [J]. ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2023, 31 (02): : 85 - 100
  • [7] Perfect matching in bipartite hypergraphs subject to a demand graph
    Aronshtam, Lior
    Ilani, Hagai
    Shufan, Elad
    [J]. ANNALS OF OPERATIONS RESEARCH, 2023, 321 (1-2) : 39 - 48
  • [8] Graph isomorphism algorithm by perfect matching
    Fukuda, K
    Nakamori, M
    [J]. SYSTEM MODELING AND OPTIMIZATION XX, 2003, 130 : 229 - 238
  • [9] An improved Boolean circuit for maximum matching in a convex bipartite graph
    Park, Eunhui
    Park, Kunsoo
    [J]. FUNDAMENTA INFORMATICAE, 2008, 84 (01) : 81 - 97
  • [10] Bipartite double cover and perfect 2-matching covered graph with its algorithm
    Gan, Zhiyong
    Lou, Dingjun
    Zhang, Zanbo
    Wen, Xuelian
    [J]. FRONTIERS OF MATHEMATICS IN CHINA, 2015, 10 (03) : 621 - 634
12345