Maximum Induced Matchings in Grids (Q4596162)

From MaRDI portal

Jump to:navigation, search

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

scholarly article

0 references

Maximum Induced Matchings in Grids (English)

0 references

Ruxandra Marinescu-Ghemeci

0 references

Optimization Theory, Decision Making, and Operations Research Applications

0 references

publication date

30 November 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-5134-1_12

0 references

Minimizing flow time in the wireless gathering problem

0 references

Induced matchings

0 references

Induced matchings in intersection graphs.

0 references

Finding a maximum induced matching in weakly chordal graphs

0 references

New results on maximum induced matchings in bipartite graphs and beyond

0 references

Induced matchings in bipartite graphs

0 references

New results on induced matchings

0 references

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

0 references

On maximum induced matchings in bipartite graphs

0 references

Maximum weight edge-constrained matchings

0 references

NP-completeness of some generalizations of the maximum matching problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-1-4614-5134-1_12

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4596162

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4596162&oldid=36359987"