A generalized framework for listing cuts and graphs

DOI10.15807/JORSJ.57.75MaRDI QIDQ2928995zbMATH OpenOpenAlexFDO

Authors Makoto Yaguchi

Publication date 10 November 2014

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.57.75

zbMATH Keywords

\((s, K)\)-cutenumerationgraph theory

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• A paradigm for listing \((s,t)\)-cuts in graphs
• Efficient Algorithms for the k Smallest Cuts Enumeration
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
• Suboptimal cuts: their enumeration, weight and number (extended abstract)
• scientific article; zbMATH DE number 2050721

Cited in

(1)

• A paradigm for listing \((s,t)\)-cuts in graphs

This page was built for publication: A generalized framework for listing cuts and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928995)