Testing for Equality between Maximum Matching and Minimum Node Covering (Q1242177): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(77)90068-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005835707 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5578815 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Latest revision as of 22:23, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing for Equality between Maximum Matching and Minimum Node Covering |
scientific article |
Statements
Testing for Equality between Maximum Matching and Minimum Node Covering (English)
0 references
1977
0 references
