Shortest Augmenting Paths for Online Matchings on Trees (Q2788991): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts Tag: Manual revert |
EloiFerrer (talk | contribs) Merged Item from Q5918461 |
||||||||||||||
aliases / en / 0 | aliases / en / 0 | ||||||||||||||
A tight bound for shortest augmenting paths on trees | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 7458776 | |||||||||||||||
Property / title | |||||||||||||||
A tight bound for shortest augmenting paths on trees (English) | |||||||||||||||
Property / title: A tight bound for shortest augmenting paths on trees (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1486.68124 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1016/j.tcs.2021.11.025 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Anna Zych-Pawlewicz / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Theoretical Computer Science / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
18 January 2022
| |||||||||||||||
Property / publication date: 18 January 2022 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 7458776 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W4206781189 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
online algorithm | |||||||||||||||
Property / zbMATH Keywords: online algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
bipartite matching | |||||||||||||||
Property / zbMATH Keywords: bipartite matching / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
trees | |||||||||||||||
Property / zbMATH Keywords: trees / rank | |||||||||||||||
Normal rank |
Latest revision as of 09:35, 6 May 2024
scientific article; zbMATH DE number 7458776
- A tight bound for shortest augmenting paths on trees
Language | Label | Description | Also known as |
---|---|---|---|
English | Shortest Augmenting Paths for Online Matchings on Trees |
scientific article; zbMATH DE number 7458776 |
|
Statements
Shortest Augmenting Paths for Online Matchings on Trees (English)
0 references
A tight bound for shortest augmenting paths on trees (English)
0 references
26 February 2016
0 references
18 January 2022
0 references
online algorithm
0 references
bipartite matching
0 references
trees
0 references