Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
From MaRDI portal
Publication:5302727
DOI10.1007/978-3-540-89812-2_7zbMath1162.68653OpenAlexW1556799522MaRDI QIDQ5302727
Publication date: 13 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89812-2_7
Uses Software
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- 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
- Optimal union-find in Constraint Handling Rules
- Welcome to Constraint Handling Rules
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Worst-case Analysis of Set Union Algorithms
- Theory and practice of constraint handling rules
- Logic Programming
- Logic Programming