Relation-algebraic modeling and solution of chessboard independence and domination problems
From MaRDI portal
Publication:1931899
DOI10.1016/j.jlap.2012.05.001zbMath1280.68301OpenAlexW2067778682MaRDI QIDQ1931899
Publication date: 16 January 2013
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2012.05.001
independencerelation algebradominationBishops independence numberchessboard relationrelational modeling
Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Combinatorial games (91A46)
Related Items
Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Computing and visualizing Banks sets of dominance relations using relation algebra and RelView ⋮ A general method for representing sets of relations by vectors ⋮ Domination in Chessboards
Uses Software
Cites Work
- The rook problem on saw-toothed chessboards
- Applying relation algebra and RelView to solve problems on orders and lattices
- A survey of known results and research areas for \(n\)-queens
- Applying relation algebra and RelView to measures in a social network
- Chessboard domination problems
- Monomorphic characterization of \(n\)-ary direct products
- An interdisciplinary approach to coalition formation
- Graph-Based Algorithms for Boolean Function Manipulation
- Branching Programs and Binary Decision Diagrams
- Computer Algebra in Scientific Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relation-algebraic modeling and solution of chessboard independence and domination problems
