Identifying critical nodes in a graph is important to understand the structural characteristics
and the connectivity properties of the network. In this paper, we focus on detecting critical …

We study the following problem: A data distributor has given sensitive data to a set of
supposedly trusted agents (third parties). Some of the data are leaked and found in an …

There is a strong case for electrical network topologists and submodular function theorists
being aware of each other's fields. Presenting a topological approach to electrical network …

Given a system (V, T, f, k), where V is a finite set, is a submodular function and k≥ 2 is an
integer, the general multiway partition problem (MPP) asks to find ak-partition={V 1, V 2,..., V …

We consider methodologies for managing risk in a telecommunication network based on
identification of the critical nodes. The objective is to identify a set of vertices with a specified …

Given a graph and an integer k, the objective of the critical node problem (cnp) is to find a
set of k nodes in the graph whose deletion results in the maximum network fragmentation …

Given a graph with nonnegative edge-weights, let f (k) be the value of an optimal solution of
the k-cut problem. We study f as a function of k. Let g be the convex envelope of f. We give a …

In submodular $ k $-partition, the input is a non-negative submodular function $ f $ defined
over a finite ground set $ V $(given by an evaluation oracle) along with a positive integer $ k …

Methods for improving sponsored search revenue are often tested or deployed within a
small submarket of the larger marketplace. For many applications, the ideal submarket …

We present an efficient heuristic for finding good bipartitions of the vertex set of a graph in
the sense of the well-known measure of ratioCut (essentially the ratio between weight of cut …