IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p889-d1607029.html
   My bibliography  Save this article

On the Complexity of Computing a Maximum Acyclic Matching in Undirected Graphs

Author

Listed:
  • Samer Nofal

    (Department of Computer Science, German Jordanian University, Amman 11180, Jordan)

Abstract

The problem of finding a maximum acyclic matching in a simple undirected graph is known to be NP-complete. In this paper, we present new results; we show that a maximum acyclic matching in a given undirected graph (with n vertices and m edges) can be computed recursively with a recursion depth O ( ln m ) in expectation. Consequently, employing a recursive computation of a maximum acyclic matching in a given graph, if the recursion depth meets the expectation O ( ln m ) , then a maximum acyclic matching can be computed in time O ( n 3.4 ) and space O ( m ln m ) . However, for the general case, the complexity of the recursive computation of a maximum acyclic matching is in O ( n 2 2 m ) time and in O ( m 2 ) space.

Suggested Citation

  • Samer Nofal, 2025. "On the Complexity of Computing a Maximum Acyclic Matching in Undirected Graphs," Mathematics, MDPI, vol. 13(5), pages 1-12, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:889-:d:1607029
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/889/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/5/889/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:5:p:889-:d:1607029. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.