Complexity and Applications of Edge-Induced Vertex-Cuts

  title={Complexity and Applications of Edge-Induced Vertex-Cuts},
  author={Marko Samer and Stefan Szeider},
Motivated by hypergraph decomposition algorithms, we intr oduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexit y of computing minimum edge-induced vertex-cuts and demonstrate the usefulne ss of our notion by applications in network reliability and constraint satisf action. 

From This Paper

Figures, tables, and topics from this paper.
6 Citations
13 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 13 references

Goldberg and Robert E . Tarjan . A new approach to te maximum - flow problem

  • V Andrew
  • Journal of the ACM
  • 2006

Norman and Michael O . Rabin . An algorithm for a mini um cover of a graph

  • Z Robert
  • Invitation to Fixed - Parameter Algorithms
  • 2006

editors,Network Analysis: Methodological Foundations

  • Frank Kammer, Thomas Erlebach
  • ofLecture Notes in Computer Science ,
  • 2005
2 Excerpts

A simple min-cut algor ithm

  • Mechthild Stoer, Frank Wagner
  • Journal of the ACM,
  • 1997
2 Excerpts

A simple hypergraph min cut algorithm

  • Regina Klimmek, Frank Wagner
  • Technical Report B
  • 1996
1 Excerpt

Network Flows

  • Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
  • 1993
3 Excerpts

Similar Papers

Loading similar papers…