26 search results - page 6 / 6 » Edge Disjoint Graph Spanners of Complete Graphs and Complete... |
CPC
2010
13 years 3 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...