On the public citation graph

On Backtracking: A Combinatorial Description of the Algorithm

0 signed · 19 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1038/scientificamerican0972-176openalex-snapshot
Mathematical Games
inferredcites →https://doi.org/10.1145/321296.321300openalex-snapshot
Backtrack Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380250805openalex-snapshot
CBack: A simple tool for backtrack programming in C
inferred← citeshttps://doi.org/10.1007/3-540-45622-8_6openalex-snapshot
Dynamic Bundling: Less Effort for More Solutions
inferred← citeshttps://doi.org/10.1007/bf01934394openalex-snapshot
Fundamental solutions of the eight queens problem
inferred← citeshttps://doi.org/10.1007/bfb0090026openalex-snapshot
On the ordering, ranking, and random generation of basic combinatorial sets
inferred← citeshttps://doi.org/10.1007/s10726-018-9607-5openalex-snapshot
The Analysis of Interconnected Decision Areas: A Computational Approach to Finding All Feasible Solutions
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90112-6openalex-snapshot
Construction of vector lists and isomorph rejection
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50019-8openalex-snapshot
Complementary Approaches to CNF Boolean Equations
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80006-4openalex-snapshot
Constraint Satisfaction: An Emerging Paradigm
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1080/01969727608927524openalex-snapshot
FUZZY ROBOT CONTROLS
inferred← citeshttps://doi.org/10.1090/s0002-9939-1976-0392600-9openalex-snapshot
Combinatorial Structures and Group Invariant Partitions
inferred← citeshttps://doi.org/10.1098/rstb.2003.1317openalex-snapshot
Abstraction and reformulation in artificial intelligence
inferred← citeshttps://doi.org/10.1137/0203013openalex-snapshot
Isomorph Rejection on Power Sets
inferred← citeshttps://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferred← citeshttps://doi.org/10.1145/322003.322010openalex-snapshot
The Power of Dominance Relations in Branch-and-Bound Algorithms
inferred← citeshttps://doi.org/10.3390/rs11171963openalex-snapshot
From BIM to Scan Planning and Optimization for Construction Control
inferred← citeshttps://doi.org/10.5555/1071509.1071564openalex-snapshot
N-queens pattern generation: an insight into space complexity of a backtracking algorithm
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.