相关论文: Blocking unions of arborescences

In this work, we study how to maintain a forest of arborescences of maximum arc cardinality under arc insertions while minimizing recourse -- the total number of arcs changed in the maintained solution. This problem is the "arborescence…

Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we are partitioning the vertices into independent sets, for…

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…

The component size of a graph is the maximum number of edges in any connected component of the graph. Given a graph $G$ and two integers $k$ and $c$, $(k,c)$-Decomposition is the problem of deciding whether $G$ admits an edge partition into…

We study how to sparsify connectivity in graphs under a tight deletion budget. Given a graph $G$ and integers $k,x \ge 0$, Critical Node Cut (CNC) asks whether we can delete at most $k$ vertices so that the number of remaining unordered…

We study the following two fixed-cardinality optimization problems (a maximization and a minimization variant). For a fixed $\alpha$ between zero and one we are given a graph and two numbers $k \in \mathbb{N}$ and $t \in \mathbb{Q}$. The…

Let F be a finite family of graphs. In the F-Deletion problem, one is given a graph G and an integer k, and the goal is to find k vertices whose deletion results in a graph with no minor from the family F. This may be regarded as a…

Minimum $k$-Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the number of edges between these sets. When $k$ is an input…

We study the problem of packing arborescences in the random digraph $\mathcal D(n,p)$, where each possible arc is included uniformly at random with probability $p=p(n)$. Let $\lambda(\mathcal D(n,p))$ denote the largest integer $\lambda\geq…

We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph $G$, a budget $k$ and a target density $\tau_\rho$, are there $k$ edges…

We introduce the notion of \emph{bounded diameter arboricity}. Specifically, the \emph{diameter-$d$ arboricity} of a graph is the minimum number $k$ such that the edges of the graph can be partitioned into $k$ forests each of whose…

Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem is known to be W[1]-hard in general directed graphs. In this…

Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…

Let G = (V, E) be a directed and weighted graph with vertex set V of size n and edge set E of size m, such that each edge (u, v) \in E has a real-valued weight w(u, c). An arborescence in G is a subgraph T = (V, E') such that for a vertex u…

For a fixed finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem asks, given an $n$-vertex input graph $G,$ for the minimum number of vertices that intersect all minor models in $G$ of the graphs in ${\cal F}$. by…

The Densest $k$-Subgraph (D$k$S) problem, and its corresponding minimization problem Smallest $p$-Edge Subgraph (S$p$ES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and…

We consider the problem of deterministically enumerating all minimum $k$-cut-sets in a given hypergraph for any fixed $k$. The input here is a hypergraph $G = (V, E)$ with non-negative hyperedge costs. A subset $F$ of hyperedges is a…

We study the problem of deleting the smallest set $S$ of vertices (resp. edges) from a given graph $G$ such that the induced subgraph (resp. subgraph) $G \setminus S$ belongs to some class $\mathcal{H}$. We consider the case where graphs in…

Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…

We consider several problems related to packing forests in graphs. The first one is to find $k$ edge-disjoint forests in a directed graph $G$ of maximal size such that the indegree of each vertex in these forests is at most $k$. We describe…