Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
From MaRDI portal
Recommendations
Cites work
- A fast algorithm for solving systems of linear equations with two variables per equation
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- scientific article; zbMATH DE number 1566503 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic Programming
- Logic Programming
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal union-find in Constraint Handling Rules
- Theory and practice of constraint handling rules
- Welcome to Constraint Handling Rules
- Worst-case Analysis of Set Union Algorithms
Cited in
(5)- A linear-time algorithm for a special case of disjoint set union
- Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
- Optimal union-find in Constraint Handling Rules
- Corrigendum to ``A simple and efficient union-find-delete algorithm
- scientific article; zbMATH DE number 7650865 (Why is no real title available?)
This page was built for publication: Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302727)