For a fixed integer k ≥ 2 k≥ 2, the hypergraph k-cut problem asks for a smallest subset of
hyperedges whose removal leads to at least k connected components in the remaining …

We study algorithmic and structural aspects of connectivity in hypergraphs. Given a
hypergraph H=(V,E) with n=|V|, m=|E|, and p=e∈E|e| the fastest known algorithm to compute …

Abstract Li and Panigrahi [Jason Li and Debmalya Panigrahi, 2020], in recent work,
obtained the first deterministic algorithm for the global minimum cut of a weighted undirected …

We initiate the study of hedge connectivity of undirected graphs, motivated by dependent
edge failures in real-world networks. In this model, edges are partitioned into groups called …

We study algorithmic and structural aspects of connectivity in hypergraphs. Given a
hypergraph H=(V, E) with n=│ V│, m=| E| and p= Σ e∊ E lel the fastest known algorithm to …

On hypergraphs with m hyperedges and n vertices, where p denotes the total size of the
hyperedges, we provide the following results: We give an algorithm that runs in Õ (mn 2 k–2) …

The submodular system k-partition problem is a problem of partitioning a given finite set V
into k non-empty subsets V 1, V 2,…, V k so that i=1^kf(V_i) is minimized where f is a non …

We consider multiobjective and parametric versions of the global minimum cut problem in
undirected graphs and bounded-rank hypergraphs with multiple edge cost functions. For a …

Predicting future dynamics on networks is challenging, especially when the complete and
accurate network topology is difficult to obtain in real-world scenarios. Moreover, the higher …

A cactus representation of a graph, introduced by Dinitz et al. in 1976, is an edge sparsifier
of O (n) size that exactly captures all global minimum cuts of the graph. It is a central …