Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:53, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms |
scientific article |
Statements
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (English)
0 references
19 August 2004
0 references
Vertex cover
0 references
Bipartite graph
0 references
Graph matching
0 references
Parameterized computation
0 references
