W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
Vazirani , year =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.
citing papers explorer
-
W-state graphs: Structure and Algorithms
W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
-
Feasibilism, Explication, and the Cobham-Edmonds Thesis
Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.