منابع مشابه
Structured Connectivity Augmentation
We initiate the algorithmic study of the following “structured augmentation” question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition of G and H with respect to injective mapping φ : V (H) → V (G) if every edge uv of F is either an edge of G, or φ−1(u)φ−1(v) is an edge of H. Thus F contain...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملHypergraph connectivity augmentation
The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet prescribed local connectivity requirements. We provide here a minimax theorem for this problem. The result is derived from the degree constrained version of the problem by a standard method. We shall construct the required hypergraph for the latter problem by a greedy type algorithm. A similar minimax result wi...
متن کاملConnectivity augmentation algorithms
The main subject of the thesis is connectivity augmentation: we would like to make a given graph k-connected by adding a minimum number of new edges. There are four basic problems in this field, since one might consider both edgeand node-connectivity augmentation in both graphs and digraphs. The thesis wishes to contribute to three out of these four problems: directedand undirected node-connect...
متن کاملSubgraph Induced Planar Connectivity Augmentation
Given a planar graph G = (V,E) and a vertex set W ⊆ V , the subgraph induced planar connectivity augmentation problem asks for a minimum cardinality set F of additional edges with end vertices in W such that G′ = (V,E∪F ) is planar and the subgraph of G′ induced by W is connected. The problem arises in automatic graph drawing in the context of c-planarity testing of clustered graphs. We describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1146233