Every undirected graph G has a (weighted) cut-equivalent tree T, commonly named after
Gomory and Hu who discovered it in 1961. Both T and G have the same node set, and for …

We design an n^2+o(1)-time algorithm that constructs a cut-equivalent (Gomory-Hu) tree of a
simple graph on n nodes. This bound is almost-optimal in terms of n, and it improves on the …

Let G be a directed multi-graph on n vertices and m edges with a designated source vertex s
and a designated sink vertex t. We study the (s, t)-cuts of capacity minimum+ 1 and as an …

Abstract Let G=(V, E) be an undirected graph on n vertices with non-negative capacities on
its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows …

Algorithmic design has been one of the main subjects of interest for Computer science.
While very effective in some areas, this approach has been met with some practical dead …

Given a graph G, graph compression problems ask to construct succinct data structures that
maintain certain properties of G. Within this context, this thesis studies problems of vertex …

Background. The chromatic index of a graph is the least number of colors needed for a
proper edge-coloring. Vizing's theorem implies that the chromatic index is either∆ or∆+ 1 …