Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (Q387819): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2013.03.015 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065389185 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding all maximally-matchable edges in a bipartite graph / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.03.015 / rank | |||
Normal rank | |||
Latest revision as of 16:07, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' |
scientific article |
Statements
Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (English)
0 references
17 December 2013
0 references
bipartite graphs
0 references
perfect matchings
0 references
maximum matchings
0 references
maximally-matchable edges
0 references
