The Set Union Problem with Unlimited Backtracking

DOI10.1137/S0097539789173597zbMath0802.68063OpenAlexW2006389717MaRDI QIDQ4286228

Giuseppe F. Italiano, Maurizio Talamo, Giorgio Gambosi, Alberto Apostolico

Publication date: 21 December 1994

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

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

zbMATH Keywords

disjoint set uniondata structuredeunioncell probe model of computationseparable-pointer algorithmsunlimited backtrack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

This page was built for publication: The Set Union Problem with Unlimited Backtracking