Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897564zbMATH OpenFDO

Authors Manuel Bodirsky, Daniel Král'

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Locally consistent constraint satisfaction problems
• Automata, Languages and Programming
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Locally finite constraint satisfaction problems
• Limit Behavior of Locally Consistent Constraint Satisfaction Problems
• On binary constraint problems
• Mathematical Foundations of Computer Science 2005
• Local consistency and SAT-solvers
• The complexity of Boolean constraint satisfaction local search problems

Cited in

(9)

• Locally consistent constraint satisfaction problems
• Automata, Languages and Programming
• Limit Behavior of Locally Consistent Constraint Satisfaction Problems
• Binary constraint satisfaction problems defined by excluded topological minors
• Tree dualities for constraint satisfaction
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
• Mathematical Foundations of Computer Science 2005
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• On the Power of k-Consistency

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897564)