Sciweavers

Share
ACSC
2005
IEEE

Large k-Separated Matchings of Random Regular Graphs

12 years 5 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense). We consider the problem of approximating the solution to the maximum k-separated matching problem in random r-regular graphs for each fixed integer k and each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial upper bounds on the size of the optimal solutions.
Mihalis Beis, William Duckworth, Michele Zito
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where ACSC
Authors Mihalis Beis, William Duckworth, Michele Zito
Comments (0)
books