DeepAI AI Chat
Log In Sign Up

Edge-cuts Optimized for Average Weight: a new alternative to Ford and Fulkerson

by   Scott Payne, et al.
Florida International University
West Virginia University

Let G be a directed graph associated with a weight w: E(G) → R^+. For an edge-cut Q of G, the average weight of Q is denoted and defined as w_ave(Q)=∑_e∈ Qw(e)/|Q|. An edge-cut of optimal average weight is an edge-cut Q such that w_ave(Q) is maximum among all edge-cuts (or minimum, symmetrically). In this paper, a polynomial algorithm for this problem is proved for finding such an optimal edge-cut in a rooted tree, separating the root and the set of all leafs. This algorithm enables us to develop an automatic clustering method with more accurate detection of communities embedded in a hierarchy tree structure.


page 1

page 2

page 3

page 4


Approximating the Weighted Minimum Label s-t Cut Problem

In the weighted (minimum) Label s-t Cut problem, we are given a (directe...

MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems

Let V be a set of n vertices, M a set of m labels, and let 𝐑 be an m × n...

Unit Perturbations in Budgeted Spanning Tree Problems

The minimum spanning tree of a graph is a well-studied structure that is...

Solving the minimum labeling global cut problem by mathematical programming

Let G = (V, E, L) be an edge-labeled graph such that V is the set of ver...

Predictors of short-term decay of cell phone contacts in a large scale communication network

Under what conditions is an edge present in a social network at time t l...

On the Dominant of the Multicut Polytope

Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...

Practical Fully Dynamic Minimum Cut Algorithms

We present a practically efficient algorithm for maintaining a global mi...