Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science
On the number of minimum size separating vertex sets in a graph and how to find all of them
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Journal of the ACM (JACM)
Computing connected components on parallel computers
Communications of the ACM
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Finding All Minimal Separators of a Graph
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
| Hi-index | 0.00 |
We show that all minimal a-b separators (vertex sets) disconnecting a pair of given non-adjacent vertices a and b in an undirected and connected graph with n vertices can be computed in O(n2Rab) time, where Rab is the number of minimal a-b separators. This result matches the known worst-case time complexity of its counterpart problem of computing all a-b cutsets (edge sets) [13] and solves an open problem posed in [11].