What people are saying - Write a review
We haven't found any reviews in the usual places.
Elements of a theory
Data structures for reluctant media
3 other sections not shown
1:1 encoding acyclic directed graph adjacent algebraic arbitrary asymptotic Chapter Claim complete graph computational resources construction contains coset construction covering radius cycle basis defined denoted described directed edge directed graphs domatic number dominating set edge of G elements of order encodes H encoding graphs error-correcting codes Euler characteristic finite fields function G and H G encodes given by Theorem graph embedding graph encoding graph G graph isomorphism graphs in graphs homomorphism induction hypothesis induction step input restricted integer least Lemma literals lower bound minimum degree multiprocessor not-all-equal NP complete partial surjection planar encoding planar graph processors Proof Proposition regular graph reluctant memory codes resource graph scheduling problem set of vertices shown in Figure simulation problem subgraph of G subtree Suppose Theorem Theorem 3.6 total encoding tree trivial truth assignment undirected upper bound variable component vertex colored vertex set vertices of G