Modeling Exclusion with a Differentiable Factor Graph Constraint Jason Naradowsky 1 Sebastian Riedel 2 Abstract With the adoption of general neural network architectures, many researchers have opted to trade

Source URL: deepstruct.github.io

Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation Stefano Gualandi, Federico Malucelli Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Piazza L. da Vinci 32, M

Source URL: www.optimization-online.org

Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

Source URL: mmds-data.org

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Source URL: www.ifor.math.ethz.ch

• Graph theory
• Mathematics
• Constraint programming
• Discrete mathematics
• Morphisms
• Constraint satisfaction problem
• Graph homomorphism
• Constraint satisfaction
• Complexity of constraint satisfaction
• Graph minor

Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic

Source URL: library.utia.cas.cz

• Graph theory
• Mathematics
• Matroid theory
• Constraint programming
• Decomposition method
• Quadtree
• Tree decomposition
• Ear decomposition
• Decomposition

Helmert’s and Bowie’s Geodetic Mapping Methods and Their Relation to Graph-Based SLAM Pratik Agarwal Wolfram Burgard

Source URL: www.lifelong-navigation.eu

• Geodesy
• Measurement
• Surveying
• Geomatics
• Geography
• Constraint programming
• Global Positioning System
• Navigation
• Decomposition method
• Simultaneous localization and mapping
• Least squares adjustment
• Geodetic datum

Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

Source URL: mmds-data.org

• Graph theory
• Mathematics
• Discrete mathematics
• Graph
• Complement graph
• Algorithm
• Planar graphs
• Book:Graph Theory

sets-graph-msuc-opt.ipeps

Source URL: tmancini.di.uniroma1.it

• Logic in computer science
• Automated theorem proving
• Constraint programming
• Boolean algebra
• Propositional calculus
• Unsatisfiable core
• Boolean satisfiability problem
• Resolution
• Maximum satisfiability problem
• Satisfiability
• Package manager
• Debian

Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Source URL: resources.mpi-inf.mpg.de

• Graph coloring
• Hypergraphs
• NP-complete problems
• Vertex cover
• Edge coloring
• Matching
• Constraint programming
• ErdsFaberLovsz conjecture
• Constraint graph

Popular Matching: A Constraint Programming Approach Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O’Sullivan Insight Centre for Data Analytics, University College Cork, Ireland ∗ {sorina.chisca, mohamed.

Source URL: womencourage.acm.org

• Matching
• Bipartite graph
• Stable marriage problem
• HopcroftKarp algorithm