Complexity and Applications of Edge-Induced Vertex-Cuts
Discrete Mathematics
2007-05-23 v2 Computational Complexity
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.
Keywords
Cite
@article{arxiv.cs/0607109,
title = {Complexity and Applications of Edge-Induced Vertex-Cuts},
author = {Marko Samer and Stefan Szeider},
journal= {arXiv preprint arXiv:cs/0607109},
year = {2007}
}
Comments
17 pages, 5 figures, 2 tables