Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2003.09.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2003.09.003 / rank | |||
Normal rank | |||
Latest revision as of 11:06, 16 December 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
