Given a directed graph G=(V,A) with a non-negative weight (length) function on its arcs w:A→ℝ+ and two terminals s,t∈V, our goal is to destroy all short directed paths from s to t in G by eliminating… (More)

We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in both the directed and undirected cases. More precisely, given a family of negative (directed) cycles,… (More)

We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus can be solved in… (More)

The game SEKI is played on an (m × n)-matrix A with non-negative integer entries. Two players R (for rows) and C (for columns) alternately reduce a positive entry of A by 1 or pass. If they pass… (More)

In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial time, i.e., for every… (More)

Let G = (V, E) be an undirected graph, and let B ⊆ V ×V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every… (More)

OF THE DISSERTATION On Generation of Cut Conjunctions, Minimal k-Connected Spanning Subgraphs, Minimal Connected and Spanning Subsets and Vertices by Konrad Borys Dissertation Director: Professor… (More)

Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ⊆ E such that every… (More)

We show that k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k. We also show that generating k-edge connected spanning subgraphs,… (More)