Return to search

The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs

No description available.
Identiferoai:union.ndltd.org:OhioLink/oai:etd.ohiolink.edu:dayton1262624006
Date January 2009
CreatorsKrishnamurthy, Chandra Mohan
PublisherUniversity of Dayton / OhioLINK
Source SetsOhiolink ETDs
LanguageEnglish
Detected LanguageEnglish
Typetext
Sourcehttp://rave.ohiolink.edu/etdc/view?acc_num=dayton1262624006
Rightsunrestricted, This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.

Page generated in 0.0024 seconds