The following pages link to (Q3786030):
Displaying 9 items.
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Constraint programming and graph algorithms. (Q1353921) (← links)
- Constraint relaxation may be perfect (Q2384384) (← links)
- (Q3493317) (← links)
- Dynamic algorithms for classes of constraint satisfaction problems (Q5941281) (← links)