What people are saying - Write a review
We haven't found any reviews in the usual places.
A Tourist Guide trough Treewidth
A Lower Bound for OnLine VectorPacking
Some problems concerning Armstrong relations of dual schemes
23 other sections not shown
Other editions - View all
Acta Cybernetica active subtree algebra algorithm alternating arbitrary assume automaton biflow bipartite graph Boolean called candidate keys choice functions closure operation cographs complete computation tree Computer Science configuration congruence consider construct contains context-free languages Corollary corresponding D-scheme database defined definition Demetrovics denote DR-recognizable edge elements equivalent EX-tree existential exists follows given grammar graph G graph properties Hence homomorphism Hungary implies induction input integer intersection interval graphs isomorphic labeled Lemma matrix minimal clones minimal keys monoid morphism node nontrivial normal form notation NP-complete obtain pair path polynomial problem processor Proof Proposition prove random recogniser regular regular language relation scheme requested item right ideal satisfies semiautomaton semilattice split graphs steady state cost stochastically smaller strict code subset Suppose symbol Szeged Theorem theory tree automata tree language treewidth unique universal computation steps vertex vertices w-generator xy-ssmc