An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems
From MaRDI portal
Publication:4154057
DOI10.1137/0207014zbMath0375.68021OpenAlexW2028378628MaRDI QIDQ4154057
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Algorithms in computer science (68W99)
Related Items (1)
This page was built for publication: An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems