article

Free access

A sufficient condition for backtrack-bounded search

Author:

Eugene C. FreuderAuthors Info & Claims

Journal of the ACM (JACM), Volume 32, Issue 4

Pages 755 - 761

https://doi.org/10.1145/4221.4225

Published: 01 October 1985 Publication History

PDF eReader

Abstract

Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems. The solutions involve a combination of relaxation preprocessing and backtrack search. The bounds are expressed in terms of the structure of the constraint connections. Specifically, the effort is shown to have a bound exponential in the size of the largest biconnected component of the constraint graph, as opposed to the size of the graph as a whole.

References

[1]

BITNER, J. R., AND REINGOLD, E. M.Backtrack programming techniques. Commun. ACM 18, 11 (Nov. 1975), 651-656.

Crossref

Google Scholar

[2]

BROWN, C. A., AND PURDOM, P. W. JR.,How to search efficiently. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Vancouver, Canada), 1981, pp. 588-594.

Google Scholar

[3]

FIKES, R. E. REF-ARF: A system for solving problems stated as procedures. Artif Intell. 1, 1 (1970), 27-120.

Google Scholar

[4]

FREUDER, E.C. Synthesizing constraint expressions. Commun. ACM 2i, ii (Nov. i978), 958- 966.

Crossref

Google Scholar

[5]

FREUDER, E. C. A sufficient condition for backtrack-free search. J. ACM 29, 1 (Jan. 1982), 24- .)Z.

Crossref

Google Scholar

[6]

HARALICK, R. M., AND SHAPIRO, L. G. The consistent labeling problem: Part I. IEEE Trans. Pattern Anal. Machine Intell. PAMI-I. IEEE, New York, 2 (Apr. 1979), pp. 173-184.

Google Scholar

[7]

HARALICK, R. M Davis L., Rosenfeld AND Milgram, D Reduction operations fpr constraint l., ............ satisfaction. Inf. Sci. 14 (1978), 199-219.

Google Scholar

[8]

KNUTH, D. E.Estimating the efficiency of backtrack programs. Math. Comput. 29 (Jan. 1975), 121-136.

Google Scholar

[9]

MACKWORTH, A. K.Consistency in networks of relations. Artif Intell. 8 (1977), 99-118.

Google Scholar

[10]

MONTANARI, U.etworks of constraints: Fundamental properties and applications to picture processing. Inf Sei. 7, 2 (Apr. 1974), 95-132.

Google Scholar

[11]

REINGOLD, E. M., NIEVERGELT, J., AND DEO, N.Combinatorial Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1977.

Crossref

Google Scholar

[12]

TARJAN, R. E.Depth-first search and linear graph algorithms. SlAM J. Comput. 1 (1972), 146- 160.

Google Scholar

[13]

ULLMAN, J. R.Associating parts of patterns. Inf. Control 9 (1966), 583-601.

Google Scholar

[14]

WALTZ, D. L. Understanding line drawings of scenes with shadows. In The Psychology of Computer Vision, P. H. Winston, Ed. Mct_iraw-Hiii, New York, 1975, pp. 19-91.

Google Scholar

Cited By

View all

Fichte JGanian RHecher MSlivovsky FOrdyniak S(2023)Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175675(1-14)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175675
Van Hentenryck Pvan Hoeve W(2023)Constraint ProgrammingEncyclopedia of Optimization10.1007/978-3-030-54621-2_713-1(1-16)Online publication date: 5-Aug-2023
https://doi.org/10.1007/978-3-030-54621-2_713-1
Faenza YMuñoz GPokutta S(2022)New limits of treewidth-based tractability in optimizationMathematical Programming: Series A and B10.1007/s10107-020-01563-5191:2(559-594)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s10107-020-01563-5
Show More Cited By

Index Terms

A sufficient condition for backtrack-bounded search
1. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Backtracking
    2. Data structures design and analysis
      1. Sorting and searching

Recommendations

Backtrack-Bounded Search in Polynomial Space
Average-case complexity of backtrack search for coloring sparse random graphs

We investigate asymptotically the expected number of steps taken by backtrack search for k-coloring random graphs G"n","p"("n") or proving non-k-colorability, where p(n) is an arbitrary sequence tending to 0, and k is constant. Contrary to the case of ...
A Sufficient Condition for Planar Graphs

A proper vertex coloring of a graph G = (V, E) is acyclic if G contains no bicolored cycle. Given a list assignment L = {L(v)|v∈V} of G, we say G is acyclically L-list colorable if there exists a proper acyclic coloring π of G such that π(v)∈L(v) for ...

Comments

Information & Contributors

Information

Published In

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1985

Published in JACM Volume 32, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

197
Total Citations
View Citations
978
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)18

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fichte JGanian RHecher MSlivovsky FOrdyniak S(2023)Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS56636.2023.10175675(1-14)Online publication date: 26-Jun-2023
https://doi.org/10.1109/LICS56636.2023.10175675
Van Hentenryck Pvan Hoeve W(2023)Constraint ProgrammingEncyclopedia of Optimization10.1007/978-3-030-54621-2_713-1(1-16)Online publication date: 5-Aug-2023
https://doi.org/10.1007/978-3-030-54621-2_713-1
Faenza YMuñoz GPokutta S(2022)New limits of treewidth-based tractability in optimizationMathematical Programming: Series A and B10.1007/s10107-020-01563-5191:2(559-594)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s10107-020-01563-5
Fichte JHecher MPfandler AHermanns HZhang LKobayashi NMiller D(2020)Lower Bounds for QBFs of Bounded TreewidthProceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3373718.3394756(410-424)Online publication date: 8-Jul-2020
https://dl.acm.org/doi/10.1145/3373718.3394756
Chowdhary KChowdhary K(2020)Constraint Satisfaction ProblemsFundamentals of Artificial Intelligence10.1007/978-81-322-3972-7_10(273-302)Online publication date: 5-Apr-2020
https://doi.org/10.1007/978-81-322-3972-7_10
Cohen DCooper MJeavons PŽivný S(2020)Galois Connections for Patterns: An Algebra of Labelled GraphsGraph Structures for Knowledge Representation and Reasoning10.1007/978-3-030-72308-8_9(125-150)Online publication date: 5-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-72308-8_9
Lhopital SAknine SThavonekham VVu HRamchurn S(2020)Decentralised Control of Intelligent Devices: A Healthcare Facility StudyMulti-Agent Systems and Agreement Technologies10.1007/978-3-030-66412-1_2(20-36)Online publication date: 22-Apr-2020
https://dl.acm.org/doi/10.1007/978-3-030-66412-1_2
Fichte JHecher MKieler M(2020)Treewidth-Aware Quantifier Elimination and Expansion for QCSPPrinciples and Practice of Constraint Programming10.1007/978-3-030-58475-7_15(248-266)Online publication date: 7-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58475-7_15
Bessiere C(2020)Constraint ReasoningA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06167-8_6(153-183)Online publication date: 8-May-2020
https://doi.org/10.1007/978-3-030-06167-8_6
Korhonen TBerg JJärvisalo M(2019)Enumerating potential maximal cliques via SAT and ASPProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367032.3367191(1116-1122)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367032.3367191
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Backtrack-Bounded Search in Polynomial Space

Average-case complexity of backtrack search for coloring sparse random graphs

A Sufficient Condition for Planar Graphs

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations