IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v4y2000i2d10.1023_a1009804919645.html
   My bibliography  Save this article

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Author

Listed:
  • Hiroshi Nagamochi

    (Department of Information and Computer Science, Toyohashi)

  • Shigeki Katayama

    (Toshiba Corporation Power System & Service Company, Fuchu)

  • Toshihide Ibaraki

    (Kyoto University)

Abstract

For an edge-weighted graph G with n vertices and m edges, the minimum k-way cut problem is to find a partition of the vertex set into k non-empty subsets so that the weight sum of edges between different subsets is minimized. For this problem with k = 5 and 6, we present a deterministic algorithm that runs in O(nk − 1F(n, m)) = O(mnk log (n2/m)) time, where F(n, m) denotes the time bound required to solve the maximum flow problem in G. The bounds Õ(mn5) for k = 5 and Õ(mn6) for k = 6 improve the previous best randomized bounds Õ(n8) and Õ(n10), respectively.

Suggested Citation

  • Hiroshi Nagamochi & Shigeki Katayama & Toshihide Ibaraki, 2000. "A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 151-169, June.
    • Handle: RePEc:spr:jcomop:v:4:y:2000:i:2:d:10.1023_a:1009804919645
    DOI: 10.1023/A:1009804919645
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009804919645
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009804919645?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. Olivier Goldschmidt & Dorit S. Hochbaum, 1994. "A Polynomial Algorithm for the k-cut Problem for Fixed k," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 24-37, February.
    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. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    2. Mark Velednitsky & Dorit S. Hochbaum, 0. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-21.
    3. Mark Velednitsky & Dorit S. Hochbaum, 2022. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1659-1679, October.
    4. Mourad Baïou & Francisco Barahona & Ali Ridha Mahjoub, 2000. "Separation of Partition Inequalities," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 243-254, May.
    5. Yan T. Yang & Barak Fishbain & Dorit S. Hochbaum & Eric B. Norman & Erik Swanberg, 2014. "The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 45-58, February.
    6. Marie-Christine Costa & Dominique Werra & Christophe Picouleau, 2011. "Minimum d-blockers and d-transversals in graphs," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 857-872, November.
    7. Yuefang Sun & Chenchen Wu & Xiaoyan Zhang & Zhao Zhang, 2022. "Computation and algorithm for the minimum k-edge-connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1741-1752, October.
    8. Costa, Marie-Christine & Letocart, Lucas & Roupin, Frederic, 2005. "Minimal multicut and maximal integer multiflow: A survey," European Journal of Operational Research, Elsevier, vol. 162(1), pages 55-69, April.
    9. Dmitry Krushinsky & Boris Goldengorin, 2012. "An exact model for cell formation in group technology," Computational Management Science, Springer, vol. 9(3), pages 323-338, August.
    10. Alena Otto & Erwin Pesch, 2017. "Operation of shunting yards: train-to-yard assignment problem," Journal of Business Economics, Springer, vol. 87(4), pages 465-486, May.
    11. Yuefang Sun & Chenchen Wu & Xiaoyan Zhang & Zhao Zhang, 0. "Computation and algorithm for the minimum k-edge-connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    12. Yang, Yayu & Zhang, Mingzu & Meng, Jixiang, 2024. "Link fault tolerance of BC networks and folded hypercubes on h-extra r-component edge-connectivity," Applied Mathematics and Computation, Elsevier, vol. 462(C).

    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:jcomop:v:4:y:2000:i:2:d:10.1023_a:1009804919645. 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: 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.