What people are saying - Write a review
We haven't found any reviews in the usual places.
S E Payne The Generalized Quadrangle with st 35 5
E S Elmallah and L K Stewart Domination in Polygon Graphs
A K Dewdney Single Neuron Studies
12 other sections not shown
Other editions - View all
_tree 3-tight sets adjacent algebra algorithm branching point buses CARDD characterization chords cograph colors combinational circuit Computer Science connected dominating set construction contains cotree creator of H critical pairs cycle defined denote disjoint elements endpoint example fc-tuple T-coloring G2 graph given graph G Hasse diagram Hence hyperoval incidence matrix incident independent faults input integers invariant iteration Lemma lines matrix maximum clique maximum matching minimum cardinality monotonic function nested loops neuron normal forms obtained one-factorization optimal outer district overlap graph ovoids pair parallel class permutation permutation graph planar polygon polynomial poset problem processors proof reductions regular spread root route scheduling self-dual code sequence set of equations shortest path tree simulated annealing solution span subgraph subquadrangle subset Suppose T-coloring of G tasks Term Rewriting Systems Theorem threshold function timetable tree unate unique unrolling vector upper bound vertex vertex coloring vertices