Graph theory and computing /
Guardado en:
| Otros Autores: | , |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
New York :
Academic Press,
1972.
|
| Materias: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- Claude Berge, Alternating chain methods: a survey
- N. G. de Bruijn, D. E. Knuth and S. O. Rice, The average height of planted plane trees
- Solomon W. Golomb, How to number a graph
- Frank Harary and Allen J. Schwenk, Evolution of the path number of a graph: covering and packing in graphs. II
- B. R. Heap, The production of graphs by computer
- C. A. King, A graph-theoretic programming language
- W. Kuich, Entropy of transformed finite-state automata and associated languages
- W. F. Lunnon, Counting hexagonal and triangular polyominoes
- W. F. Lunnon, Symmetry of cubical and general polyominoes
- David W. Matula, George Marble and Joel D. Isaacson, Graph coloring algorithms
- John F. Meyer, Algebraic isomorphism invariants for graphs of automata
- Ronald C. Read, The coding of various kinds of unlabeled trees
- Donald J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations
- R. Rosenstiehl, J. R. Fiksel and A. Holliger, Intelligent graphs: networks of finite automata capable of solving graph problems
- B. Roy, An algorithm for a general constrained set covering problem
- R. G. Stanton, L. O. James and D. D. Cowan, Tripartite path numbers
- W. T. Tutte, Non-Hamiltonian planar maps
- W. A. Walker and C. C. Gotlieb, A topdown algorithm for constructing nearly optimal lexicographic trees.