Join Our Newsletter

IACR

2011

10 years 11 months ago
2011

A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...

GC

2002

Springer

11 years 11 months ago
2002

Springer

An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...

ECCC

2007

11 years 11 months ago
2007

In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...

DAM

2000

11 years 11 months ago
2000

Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...

ISCI

2007

11 years 12 months ago
2007

Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...

SIAMDM

2008

11 years 12 months ago
2008

A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...

COMBINATORICS

2006

12 years 1 days ago
2006

For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...

CORR

2008

Springer

12 years 2 days ago
2008

Springer

We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...

COLT

2008

Springer

12 years 1 months ago
2008

Springer

Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...

GD

2000

Springer

12 years 3 months ago
2000

Springer

We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...