We consider the classical Minimum Balanced Cut problem: given a graph G, compute a
partition of its vertices into two subsets of roughly equal volume, while minimizing the …

This paper presents Merlin, a new framework for managing resources in software-defined
networks. With Merlin, administrators express high-level policies using programs in a …

One of the key results in Robertson and Seymour's seminal work on graph minors is the grid-
minor theorem (also called the excluded grid theorem). The theorem states that for every …

Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …

We study a basic resource allocation problem that arises in cloud computing environments.
The physical network of the cloud is represented as a graph with vertices denoting servers …

This paper presents the Merlin network management framework. With Merlin, administrators
express network policy using programs in a declarative language based on logical …

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental
result in graph theory, that states that there is some function f: Z+→ Z+, such that for any …

In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected n-
vertex graph G, and a collection M={(s 1, t 1),…,(sk, tk)} of pairs of its vertices, called source …

Treewidth is a graph parameter that plays a fundamental role in several structural and
algorithmic results. We study the problem of decomposing a given graph G into node-disjoint …

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental
result in graph theory, that states that there is some function $ f: Z^+\rightarrow Z^+ $, such …