Augmenting undirected node-connectivity by one Page 1 Augmenting Undirected Node-Connectivity
by One ∗ László A. Végh † MTA-ELTE Egerváry Research Group and Department of …

Discrete convex functions are used in many areas, including operations research, discrete-
event systems, game theory, and economics. The objective of this paper is to offer a survey …

We present a min-max formula and a polynomial time algorithm for a slight generalization of
the following problem: in a simple undirected graph in which the degree of each node is at …

Node-connectivity augmentation is a fundamental network design problem. We are given a
$ k $-node connected graph $ G $ together with an additional set of links, and the goal is to …

Discrete convex functions are used in many areas, including operations research, discrete-
event systems, game theory, and economics. The objective of this paper is to investigate …

In this paper, we consider the problem of finding a maximum weight 2-matching containing
no cycle of a length of at most three in a weighted simple graph, which we call the weighted …

A simple 2-matching in a graph is a subset of edges M such that every node is incident with
at most two edges in M. A simple 2-matching is called C k-restricted (k≥ 2) if it contains no …

For an undirected graph and a fixed integer k, a 2-matching is said to be k-restricted if it has
no cycle of length k or less. The problem of finding a maximum cardinality k-restricted 2 …

For a bipartite graph G we consider the problem of finding a maximum size/weight square-
free 2-matching and its generalization-the problem of finding a maximum size/weight K_ {t, t} …

We consider three variants of the problem of finding a maximum weight restricted 2-
matching in a subcubic graph G.(A 2-matching is any subset of the edges such that each …