Packing Edges in Random Regular Graphs-Reference-Cited by-同舟云学术

Packing Edges in Random Regular Graphs

Published:2002 Issue: Volume: Page:118-130
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Beis Mihalis,Duckworth William,Zito Michele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45687-2_9

Reference20 articles.

1. J. Aronson, A. Frieze, and B. G. Pittel. Maximum matchings in sparse random graphs: Karp-sipser revisited. Random Structures and Algorithms, 12:111–178, 1998.

2. K. Cameron. Induced matchings. Discrete and Applied Mathematics, 24(1–3):97–102, 1989.

3. J. R. Cash and A. H. Karp. A variable order runge-kutta method for initial value problems with rapidly varying right-hand sides. ACM Transactions on Mathematical Software, 16(3):201–222, 1990.

4. W. Duckworth, D. Manlove, and M. Zito. On the approximability of the maximum induced matching problem. Technical Report TR-2000-56, Department of Computing Science of Glasgow University, April 2000.

5. Lect Notes Comput Sci;W. Duckworth,2000

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Packing vertices and edges in random regular graphs;Random Structures and Algorithms;2007

2. Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold;Lecture Notes in Computer Science;2006

3. Maximum Induced Matchings of Random Regular Graphs;Combinatorial Geometry and Graph Theory;2005

4. Large 2-Independent Sets of Regular Graphs;Electronic Notes in Theoretical Computer Science;2003-04