Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:56, 5 March 2024
scientific article
| 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 |
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
