1067 search results - page 13 / 214 » Probabilistic regular graphs |
COMBINATORICS
2002
13 years 10 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
DM
2010
13 years 11 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
JCT
2008
13 years 11 months ago
2008
A graph is pseudo 2
COMBINATORICS
1999
13 years 10 months ago
1999
Abstract. Ehrenborg and Steingr
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...