Efficiency of Equivalence Algorithms

DOI10.1007/978-1-4684-2001-2_14zbMath1467.68239OpenAlexW2155803955MaRDI QIDQ4999430

Michael J. Fischer

Publication date: 6 July 2021

Published in: Complexity of Computer Computations (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/6201

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (6)

A tight lower bound for top-down skew heaps ⋮ A class of algorithms which require nonlinear time to maintain disjoint sets ⋮ Complexity of algorithm and operations on trees ⋮ Testing flow graph reducibility ⋮ A new data structure for the UNION-FIND problem ⋮ Concurrent disjoint set union

This page was built for publication: Efficiency of Equivalence Algorithms