Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph | SpringerLink
Skip to main content
Springer Nature Link
Log in

Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph

  • Conference paper
  • First Online:
Image Processing and Communications (IP&C 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1062))

Included in the following conference series:

Abstract

This paper presents an algorithm for enumerating the set of minimal edge st-cuts of an oriented graph based on search for the set of undecomposable cuts in a graph and on the entire set of minimum cuts synthesis build upon a subset of solely undecomposable cuts in the distributive lattice of minimum cuts. The method of listing the quasiminimal (following the minimal, closest to minimal) cuts of the graph is considered.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Otsukia, K., Kobayashib, Y., Murota, K.: Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network. Eur. J. Oper. Res. 248, 396–403 (2016)

    Article  MathSciNet  Google Scholar 

  2. Fishbain, B., Hochbaum, D.S., Mueller, S.: A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications. J. Real-Time Image Proc. 11(3), 589–609 (2016)

    Article  Google Scholar 

  3. Gianinazzi, L., Kalvoda, P., Palma, A., et al.: Communication-avoiding parallel minimum cuts and connected components. In: ACM Conference Principles and Practice of Parallel Programming 2018, PPoPP 2018 (2018). http://www.unixer.de/~htor/publications

  4. Sun, W., Dong, E.: Kullback-Leibler distance and graph cuts based active contour model for local segmentation. Biomed. Sig. Process. Control 52, 120–127 (2019)

    Article  Google Scholar 

  5. Liu, Z., Song, Y.Q., Sheng, V.S., et al.: Liver CT sequence segmentation based with improved U-Net and graph cut. Expert Syst. Appl. 126, 54–63 (2019)

    Article  Google Scholar 

  6. Mishra, R., Saifi, M.A., Chaturvedi, S.K.: Enumeration of minimal cutsets for directed networks with comparative reliability study for paths or cuts. Qual. Reliab. Engng. Int. 32, 555–565 (2016)

    Article  Google Scholar 

  7. Emadi, A., Afrakhte, H.: A novel and fast algorithm for locating minimal cuts up to second order of undirected graphs with multiple sources and sinks. Electr. Power Energy Syst. 62, 95–102 (2014)

    Article  Google Scholar 

  8. Liu, W., Li, J.: An improved cut-based recursive decomposition algorithm for reliability analysis of networks. Earthq. Eng. Eng. Vib. 11, 1–10 (2012)

    Article  Google Scholar 

  9. Ford, L., Fullkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)

    Google Scholar 

  10. Hu, T.: Integer Programming and Network Flows. Addison-Wesley, Reading (1969)

    MATH  Google Scholar 

  11. Grishkevich, A.A.: Combinatory Methods of Research of Extreme Structures of Mathematical Models of Electric Circuits and Systems. Publishing House JuUrGu, Chelyabinsk (2004)

    Google Scholar 

  12. Aigner, M.: Combinatorial Theory. Springer, Heidelberg (1979)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazimierz Wielki University, Chodkiewicza 30, 85-064, Bydgoszcz, Poland

    Andrey Grishkevich

Authors
  1. Andrey Grishkevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrey Grishkevich .

Editor information

Editors and Affiliations

  1. Institute of Telecommunications and Computer Science, University of Science and Technology (UTP), Bydgoszcz, Poland

    Michał Choraś

  2. Department of Telecommunications, Computer Sciences and Electrical Engineering, University of Science and Technology (UTP), Bydgoszcz, Poland

    Ryszard S. Choraś

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Grishkevich, A. (2020). Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph. In: Choraś, M., Choraś, R. (eds) Image Processing and Communications. IP&C 2019. Advances in Intelligent Systems and Computing, vol 1062. Springer, Cham. https://doi.org/10.1007/978-3-030-31254-1_9

Download citation

Publish with us

Policies and ethics