Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711): 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.1016/j.jcss.2003.09.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037479769 / rank | |||
Normal rank | |||
Revision as of 23:11, 19 March 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
