The Consistent Labeling Problem: Part I
automata homomorphism problemconsistent labelingeliminate backtrackinggeneral network constraint analysis problemgraph coloringgraph homomorphism problemLatin square puzzleslook-ahead operatorspacking problemrelational homomorphism problemscene analysisshape matchingsubgraph isomorphism problemtheorem provingtree searchunit constraint relation
Other classical set theory (including functions, relations, and set algebra) (03E20) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99) Applications of graph theory to circuits and networks (94C15)
- Counting representable sets on simple graphs
- Decomposing constraint satisfaction problems using database techniques
- Local consistency in parallel constraint satisfaction networks
- Constraint propagation techniques for the disjunctive scheduling problem
- Efficient graph automorphism by vertex partitioning
- On the arc consistency problem
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- The combinatorics of object recognition in cluttered environments using constrained search
- Graph transduction as a noncooperative game
- Semi-supervised clustering with discriminative random fields
- Model-based stroke extraction and matching for handwritten Chinese character recognition
This page was built for publication: The Consistent Labeling Problem: Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3851659)
