A note on data structures for maintaining bipartitions

DOI10.1016/J.JDA.2006.03.002zbMath1137.68022OpenAlexW1995753776MaRDI QIDQ924550

Gruia Călinescu

Publication date: 16 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.002

zbMATH Keywords

data structures

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Probing polygons minimally is hard
• Efficiency of a Good But Not Linear Set Union Algorithm
• Decision Trees for Geometric Models
• Data structures for maintaining set partitions
• Optimal Binary Identification Procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on data structures for maintaining bipartitions