Join Our Newsletter

SODA

2012

ACM

8 years 8 months ago
2012

ACM

Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...

CORR

2012

Springer

9 years 2 months ago
2012

Springer

Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...

NETWORKS

2011

9 years 9 months ago
2011

A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...

INFOCOM

2011

IEEE

9 years 10 months ago
2011

IEEE

—Extracting planar graph from network topologies is of great importance for efﬁcient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...

CORR

2011

Springer

10 years 25 days ago
2011

Springer

We develop a new technique for computing maximum ﬂow in directed planar graphs with multiple sources and a single sink that signiﬁcantly deviates from previously known techniqu...

SIAMDM

2010

10 years 1 months ago
2010

We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...

COMBINATORICA

2010

10 years 1 months ago
2010

We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...

CORR

2011

Springer

10 years 1 months ago
2011

Springer

ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...

COMGEO

2011

ACM

10 years 1 months ago
2011

ACM

A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...

CORR

2010

Springer

10 years 3 months ago
2010

Springer

In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...