204 search results - page 3 / 41 » Packing vertices and edges in random regular graphs |
94
Voted
STOC
2003
ACM
15 years 12 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
CPC
2002
14 years 11 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
CPC
2000
14 years 11 months ago
2000
100
click to vote
STOC
2009
ACM
16 years 9 days ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
DM
2007
14 years 11 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...