Tree Size by Partial Backtracking
From MaRDI portal
Publication:4167574
DOI10.1137/0207038zbMath0386.68044OpenAlexW2056084417MaRDI QIDQ4167574
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207038
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Related Items (10)
Completeness, approximability and exponential time results for counting problems with easy decision version ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ On the average number of registers needed to evaluate a special class of backtrack trees ⋮ Backtracking with multi-level dynamic search rearrangement ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations ⋮ Uniformly growing backtrack trees ⋮ Additive weights of a special class of nonuniformly distributed backtrack trees ⋮ Stochastic enumeration method for counting trees ⋮ Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard ⋮ Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
This page was built for publication: Tree Size by Partial Backtracking
