An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset

Authors:
S. Tsukiyama;I. Shirakawa;H. Ozaki;H. Ariyoshi
Affiliations:
Department of Electronic Engineering, Osaka University, Suita, Osaka, Japan 565;Department of Electronic Engineering, Osaka University, Suita, Osaka, Japan 565;Department of Electronic Engineering, Osaka University, Suita, Osaka, Japan 565;Department of Electrical Engineering, Faculty of Engineering, Ehime University, Matsuyama, Ehime, Japan 790
Venue:
Journal of the ACM (JACM)
Year:
1980

The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Separators Are as Simple as Cutsets

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Optimal top-down join enumeration

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Integration and test sequencing for complex systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph

Discrete Applied Mathematics
Generating cut conjunctions and bridge avoiding extensions in graphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Mincuts in generalized Fibonacci graphs of degree 3

Journal of Computational Methods in Sciences and Engineering
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Hi-index	0.00