Complexity and Applications of Edge-Induced Vertex-Cuts

TL;DR

This paper introduces the concept of edge-induced vertex-cuts, compares it with existing notions, analyzes its computational complexity, and demonstrates its applications in network reliability and constraint satisfaction.

Contribution

It presents a new type of vertex-cut, explores its computational complexity, and shows its practical usefulness in specific application domains.

Findings

Edge-induced vertex-cuts are a novel concept compared to traditional cuts.

Computing minimum edge-induced vertex-cuts is analyzed for complexity.

Applications demonstrate the practical relevance of the new notion.

Abstract

Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.