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 条
  • [1] Morse matchings on polytopes
    Green, R. M.
    Harper, Jacob T.
    ALGEBRAIC AND GEOMETRIC TOPOLOGY, 2012, 12 (04): : 2429 - 2450
  • [2] ON OPTIMAL MATCHINGS
    AJTAI, M
    KOMLOS, J
    TUSNADY, G
    COMBINATORICA, 1984, 4 (04) : 259 - 264
  • [3] The main theorem of discrete Morse theory for Morse matchings with finitely many rays
    Kukiela, Michal
    TOPOLOGY AND ITS APPLICATIONS, 2013, 160 (09) : 1074 - 1082
  • [4] Optimal popular matchings
    Kavitha, Telikepalli
    Nasre, Meghana
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (14) : 3181 - 3186
  • [5] Computing Large Matchings Fast
    Rutter, Ignaz
    Wolff, Alexander
    PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 183 - +
  • [6] Computing Large Matchings Fast
    Rutter, Ignaz
    Wolff, Alexander
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 7 (01)
  • [7] Opting Into Optimal Matchings
    Blum, Avrim
    Caragiannis, Ioannis
    Haghtalab, Nika
    Procaccia, Ariel D.
    Procaccia, Eviatar B.
    Vaish, Rohit
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2351 - 2363
  • [8] Morse theory of Bestvina-Brady type for posets and matchings
    Minian, Elias Gabriel
    PROCEEDINGS OF THE ROYAL SOCIETY OF EDINBURGH SECTION A-MATHEMATICS, 2024, 154 (01) : 209 - 220
  • [9] A neural algorithm for computing bipartite matchings
    Dasgupta, Sanjoy
    Meirovitch, Yaron
    Zheng, Xingyu
    Bush, Inle
    Lichtman, Jeff W.
    Navlakha, Saket
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2024, 121 (37)
  • [10] On the distributed complexity of computing maximal matchings
    Han´ćkowiak, Michal
    Karon´ski, Michal
    Panconesi, Alessandro
    SIAM Journal on Discrete Mathematics, 2001, 15 (01) : 41 - 57
12345