Local edge-connectivity augmentation in hypergraphs is NP-complete
نویسندگان
چکیده
منابع مشابه
Local edge-connectivity augmentation in hypergraphs is NP-complete
We consider a local edge-connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G = (V, E) and a subpartition of V . We are asked to find the smallest possible integer γ, for which there exists a set of size-two edges F , with |F | = γ, such that in G′ = (V,E ∪ F ), the local edge-connectivity between any pair of vertices lying in the same set in the subpartition ...
متن کاملLocal Connectivity Augmentation in Hypergraphs is NP-complete
We consider a local connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G = (V,E) and a subpartition of V . We are asked to find the smallest possible integer γ, for which there exists a set of size-two edges F , with |F |= γ, such that in G′ = (V,E ∪F), the local connectivity between any pair of vertices lying in the same set in the subpartition is at least a ...
متن کاملEdge splitting and connectivity augmentation in directed hypergraphs
We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs. MSC Classification: 05C40, 05C65, 05C85, 05C20
متن کاملMaximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a specified number of edges to an input graph to maximize the algebraic connectivity of the augmented graph is NP-hard.
متن کاملMaximizing edge-ratio is NP-complete
Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edgeratio is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.12.011