Approximating Maximum Subgraphs without Short Cycles

Lecture Notes in Computer Science - Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques ◽

10.1007/978-3-540-85363-3_10 ◽

2008 ◽

pp. 118-131 ◽

Cited By ~ 4

Author(s):

Guy Kortsarz ◽

Michael Langberg ◽

Zeev Nutov

Download Full-text