oaioai:CiteSeerX.psu:10.1.1.58.6690

On Stable Cutsets in Graphs

Abstract

We answer a question of Corneil and Fonlupt by showing that deciding whether a graph has a stable cutset is NP-complete even for restricted graph classes. Some efficiently solvable cases will be discussed, too

Similar works

Full text

thumbnail-image
oaioai:CiteSeerX.psu:10.1.1.58.6690Last time updated on 10/22/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.