1067 search results - page 13 / 214 » Probabilistic regular graphs |
COMBINATORICS
2002
15 years 6 days 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...
107
Voted
DM
2010
15 years 14 days 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...
73
Voted
JCT
2008
15 years 11 days ago
2008
A graph is pseudo 2
97
Voted
COMBINATORICS
1999
15 years 1 days ago
1999
Abstract. Ehrenborg and Steingr
CORR
2008
Springer
15 years 14 days 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...