Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-021-00904-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2769128044 / rank | |||
Normal rank | |||
Revision as of 02:01, 20 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
