Maximum Induced Matchings in Grids (Q4596162): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimizing flow time in the wireless gathering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum induced matching in weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on maximum induced matchings in bipartite graphs and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight edge-constrained matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank

Latest revision as of 19:03, 14 July 2024

scientific article; zbMATH DE number 6814273
Language Label Description Also known as
English
Maximum Induced Matchings in Grids
scientific article; zbMATH DE number 6814273

    Statements

    Identifiers