Complexity and Applications of Edge-Induced Vertex-Cuts

Simple item page
dc.creatorSamer, Marko
dc.creatorSzeider, Stefan
dc.date2006-07-25
dc.date2006-07-31
dc.date.accessioned2026-07-07T07:16:23Z
dc.date.available2026-07-07T07:16:23Z
dc.descriptionMotivated 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.
dc.description17 pages, 5 figures, 2 tables
dc.identifierhttps://arxiv.org/abs/cs/0607109
dc.identifierhttp://arxiv.org/abs/cs/0607109
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113573
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.subjectG.2.2; F.2.2
dc.titleComplexity and Applications of Edge-Induced Vertex-Cuts
dc.typetext

Files

Collections

arXiv