A polynomial-time algorithm computes a minimum-weight connectivity-preserving A,B-separator in AT-free graphs, or decides none exists, running in O(n^4 T(n,m)).
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.Discret
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Connectivity-Preserving Minimum Separator in AT-free Graphs
A polynomial-time algorithm computes a minimum-weight connectivity-preserving A,B-separator in AT-free graphs, or decides none exists, running in O(n^4 T(n,m)).