Abstract
We research on the possible orientations patterns of a grid graph G, and propose a method for counting certain combinatorial structures over the class of orientations of G. For example, our method can be applied for counting sink-free orientations of G, as well as it can be applied for solving the #2SAT problem for grid Boolean formulas.
Our proposal extends the classical transfer matrix method used for counting the number of independent sets in a grid.
Chapter PDF
References
Baxter, R.J.: Planar Lattice Gases with Nearest-Neighbour Exclusion. Annals of Combinatorics 3, 191–203 (1999)
Guillén, C., Vera, E., López-López, A., De Ita, G.: Applying the Transfer Matrix Method for Supervising Lines in a Network Grid. In: Proc. REV 2008 (2008), www.rev-conference.org
Barbosa, V.C., Ferreira, R.G.: On the phase transitions of graph coloring and independent sets. Physica A: Statistical Mechanics and its Applications 343, 401–423 (2004)
Calkin, N.J.: The Number of Independent Sets in a Grid Graph. SIAM Journal on Discrete Mathematics 11(1), 54–60 (1998)
Gärtner, B., Morris, W., Rüst, L.: Unique Sink Orientations of Grids. Algorithmica 51(2), 200–235 (2008)
Golin, M.J., Leung, Y.C., Wang, Y., Yong, X.: Counting Structures in Grid Graphs, Cylinders and Tori Transfer Matrices: Survey and New Results. In: ALENEX/ANALCO, pp. 250–258 (2005)
Grohe, M., Marx, D.: Constraint Solving via Fractional Edge Covers. In: Soda’06, Miami (2006)
Reinhardt, E.: The Fibonacci Number of a Grid Graph and a New Class of Integer Sequences. JIS Journal of Integer Sequences 88(2), 1–16 (2005) Article 05.2.6
Roth, D.: On the Hardness of Approximate Reasoning. Artificial Intelligence, 273–302 (1996)
Roth, R.M., Siegel, P.H., Wolf, J.K.: Efficient Coding Schemes for the Hard-Square Model. IEEE Trans. Inform. Theory 47, 1166–1176 (2001)
Russ, B.: Randomized Algorithms: Approximation, Generation, and Counting, Distinguished dissertations. Springer, Heidelberg (2001)
Vadhan Salil, P.: The complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31(2), 398–427 (2001)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3) (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillén, C., De Ita, G., López-López, A. (2010). A Novel Method for Counting Models on Grid Boolean Formulas. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Kittler, J. (eds) Advances in Pattern Recognition. MCPR 2010. Lecture Notes in Computer Science, vol 6256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15992-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-15992-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15991-6
Online ISBN: 978-3-642-15992-3
eBook Packages: Computer ScienceComputer Science (R0)