Computing optimal Morse matchings

被引：48
|
作者：
Joswig, M
Pfetsch, ME
机构：
[1] Tech Univ Darmstadt, Fachbereich Math, D-64289 Darmstadt, Germany
[2] Zuse Inst Berlin, D-14195 Berlin, Germany
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2006年 / 20卷 / 01期
关键词：
discrete Morse function; Morse matching;
D O I：
10.1137/S0895480104445885
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral results for the corresponding polytope and report on computational results.
引用
收藏
页码：11 / 25
页数：15
相关论文
共 50 条
  • [41] Computing large matchings in planar graphs with fixed minimum degree
    Franke, Robert
    Rutter, Ignaz
    Wagner, Dorothea
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (32) : 4092 - 4099
  • [42] Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
    Franke, Robert
    Rutter, Ignaz
    Wagner, Dorothea
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 872 - 881
  • [43] TRACKING IN STREAMED VIDEO BY UPDATING GLOBALLY OPTIMAL MATCHINGS
    Henriques, Joao F.
    Caseiro, Rui
    Batista, Jorge
    2010 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, 2010, : 81 - 84
  • [44] OPTIMAL PARALLEL ALGORITHMS FOR B-MATCHINGS IN TREES
    OSIAKWAN, CNK
    AKL, SG
    OPTIMAL ALGORITHMS, 1989, 401 : 274 - 308
  • [45] OPTIMAL PARALLEL ALGORITHMS FOR B-MATCHINGS IN TREES
    OSIAKWAN, CNK
    AKL, SG
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 401 : 274 - 308
  • [46] OPTIMAL SET PARTITIONING, MATCHINGS AND LAGRANGIAN-DUALITY
    NEMHAUSER, GL
    WEBER, GM
    NAVAL RESEARCH LOGISTICS, 1979, 26 (04) : 553 - 563
  • [47] Discrete Morse Theory for Computing Cellular Sheaf Cohomology
    Justin Curry
    Robert Ghrist
    Vidit Nanda
    Foundations of Computational Mathematics, 2016, 16 : 875 - 897
  • [48] Discrete Morse Theory for Computing Cellular Sheaf Cohomology
    Curry, Justin
    Ghrist, Robert
    Nanda, Vidit
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2016, 16 (04) : 875 - 897
  • [49] On the Convergence of Swap Dynamics to Pareto-Optimal Matchings
    Brandt, Felix
    Wilczynski, Anaelle
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 1063 - 1098
  • [50] An optimal algorithm for plane matchings in multipartite geometric graphs
    Biniaz, Ahmad
    Maheshwari, Anil
    Nandy, Subhas C.
    Smid, Michiel
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2017, 63 : 1 - 9
12345