Shortest Augmenting Paths for Online Matchings on Trees

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Bartłomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych

Journal title: Theory of Computing Systems

Journal publisher: Springer Verlag

Published year: 2018

DOI identifier: 10.1007/978-3-319-28684-6_6

ISSN: 1432-4350