Maximum Induced Matchings for Chordal Graphs in Linear Time

Algorithmica 2008 / 12 Vol. 52; Iss. 4

Maximum Induced Matchings for Chordal Graphs in Linear Time

Andreas Brandstädt, Chính T. Hoàng
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
52
Language:
english
Pages:
8
DOI:
10.1007/s00453-007-9045-2
Date:
December, 2008
File:
PDF, 263 KB
english, 2008
Conversion to is in progress
Conversion to is failed