First Page | Document Content | |
---|---|---|
Date: 2013-03-14 00:55:15Graph theory Graph operations NP-complete problems Bipartite graphs Combinatorial optimization Matching Line graph Chordal graph Clique Complete bipartite graph Independent set Cograph | New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b SchoolAdd to Reading ListSource URL: community.dur.ac.ukDownload Document from Source WebsiteFile Size: 438,20 KBShare Document on Facebook |