A fast algorithm for finding interlocking sets

DOI10.1016/0020-0190(89)90068-9zbMath0688.68040OpenAlexW1977213319MaRDI QIDQ1263973

Errol L. Lloyd

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90068-9

zbMATH Keywords

intervalsinterlocking setsunion find

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Single Row Routing
• An algorithm for single-row routing with prescribed street congestions
• Efficiency of a Good But Not Linear Set Union Algorithm
• Self-Adjusting Heaps

This page was built for publication: A fast algorithm for finding interlocking sets