Complexity and Applications of Edge-Induced Vertex-Cuts

Details Complexity and Applications of Edge-Induced Vertex-Cuts Complexity and Applications of Edge-Induced Vertex-Cuts

2006-07-25

arxiv.org/abs/cs/0607109v2

Computer Science

Discrete Mathematics

17 pages, 5 figures, 2 tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Complexity and Applications of Edge-Induced Vertex-Cuts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity and Applications of Edge-Induced Vertex-Cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity and Applications of Edge-Induced Vertex-Cuts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-665152