Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs |
scientific article; zbMATH DE number 7495634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs |
scientific article; zbMATH DE number 7495634 |
Statements
Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (English)
0 references
22 March 2022
0 references
graph algorithm
0 references
induced matching
0 references
chain cover
0 references
convex bipartite graph
0 references
certifying algorithm
0 references
dynamic programming
0 references
0 references
0 references
