Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711)
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: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms |
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
