IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v175y2023ip2s0960077923009244.html
   My bibliography  Save this article

Bidirectional pruned tree-based efficient minimum cut acceleration in dense graph

Author

Listed:
  • Wei, Wei
  • Li, Haoyi
  • Zhang, Qinghui

Abstract

The minimum cut (min-cut) problem has been extensively investigated, and the corresponding algorithms have been used in many related problems. The recently proposed acceleration strategy based on tree-cut mapping has been shown to be an effective alternative, with a slight loss in acceleration accuracy. However, the existing method requires a large number of ineffective traversal passes in the high-overhead preprocessing step, which has the potential to be significantly improved in mapping effective graphs, i.e. dense graphs. To solve the problem, we propose to use bidirectional pruned tree for tree-cut mapping, which combines pruned depth-first traversal tree and bidirectional traversal paths to enumerate as many different tree instances as possible. Thus, it can help find the min-cut of any node pair efficiently. Theoretical analysis also shows its potential. For its serial implementation in a graph with M edges, after a preprocessing step with a time complexity as low as O(M), 99.9% of sampled node pairs can obtain their exact min-cut value in various types of dense graphs with degrees greater than 8 in experiments. In addition, the same precision can be obtained in sparse graphs in case of unit capacity. Per-pair running time in a million-node graph can be several orders of magnitude faster than existing methods and as low as several microseconds, so can be used as an effective complement to existing methods.

Suggested Citation

  • Wei, Wei & Li, Haoyi & Zhang, Qinghui, 2023. "Bidirectional pruned tree-based efficient minimum cut acceleration in dense graph," Chaos, Solitons & Fractals, Elsevier, vol. 175(P2).
  • Handle: RePEc:eee:chsofr:v:175:y:2023:i:p2:s0960077923009244
    DOI: 10.1016/j.chaos.2023.114023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077923009244
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2023.114023?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.

    References listed on IDEAS

    as
    1. Eric Angel & Evripidis Bampis & Fadi Kacem & Dimitrios Letsios, 2019. "Speed scaling on parallel processors with migration," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1266-1282, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexander Kononov & Yulia Kovalenko, 2020. "Approximation algorithms for energy-efficient scheduling of parallel jobs," Journal of Scheduling, Springer, vol. 23(6), pages 693-709, December.

    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:eee:chsofr:v:175:y:2023:i:p2:s0960077923009244. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.