An O(N \cdot \log N) Algorithm for a Class of Matching Problems

DOI10.1137/0207014MaRDI QIDQ4154057zbMATH OpenOpenAlexFDO

Authors Nimrod Megiddo, Arie Tamir

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207014

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(1)

• Balloting Labelling and Personnel Assignment

This page was built for publication: An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154057)