IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v279y2019i1d10.1007_s10479-019-03311-1.html
   My bibliography  Save this article

On some hard and some tractable cases of the maximum acyclic matching problem

Author

Listed:
  • M. Fürst

    (Ulm University)

  • D. Rautenbach

    (Ulm University)

Abstract

Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given graph has a maximum matching that is induced or has a maximum matching that is uniquely restricted, can both be decided efficiently. In contrast to that we show that deciding whether a given bipartite graph of maximum degree at most four has a maximum matching that is acyclic is NP-complete. Furthermore, we show that maximum weight acyclic matchings can be determined efficiently for $$P_4$$ P 4 -free graphs and $$2P_3$$ 2 P 3 -free graphs, and we characterize the graphs for which every maximum matching is acyclic.

Suggested Citation

  • M. Fürst & D. Rautenbach, 2019. "On some hard and some tractable cases of the maximum acyclic matching problem," Annals of Operations Research, Springer, vol. 279(1), pages 291-300, August.
    • Handle: RePEc:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-019-03311-1
    DOI: 10.1007/s10479-019-03311-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03311-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03311-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Péter Madarasi, 2021. "Matchings under distance constraints I," Annals of Operations Research, Springer, vol. 305(1), pages 137-161, October.
    2. Juhi Chaudhary & Sounaka Mishra & B. S. Panda, 2024. "On the complexity of minimum maximal acyclic matchings," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-23, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:279:y:2019:i:1:d:10.1007_s10479-019-03311-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.