An algorithmic note on the gallai-milgram theorem (Q3033587): 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.1002/net.3230200104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005812575 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering digraphs by paths / rank | |||
Normal rank | |||
Latest revision as of 11:58, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic note on the gallai-milgram theorem |
scientific article |
Statements
An algorithmic note on the gallai-milgram theorem (English)
0 references
1990
0 references
down-up algorithm
0 references
dipath partition
0 references
posets
0 references
maximum matching
0 references
