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!
|
| LEADER | 02149cam a2200241 a 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb005775 | ||
| 008 | 721128s1972####nyua#####b####101#0#eng## | ||
| 005 | 20150707194942.0 | ||
| 245 | 0 | 0 | |a Graph theory and computing / |c edited by Ronald C. Read ; contributors: Claude Berge ... [et al.]. |
| 260 | |a New York : |b Academic Press, |c 1972. | ||
| 300 | |a xiv, 329 p. : |b il. ; |c 24 cm. | ||
| 504 | |a Incluye referencias bibliográficas. | ||
| 505 | 0 | |a 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. | |
| 510 | 4 | |a MR, |c 48 #8280 | |
| 020 | |a 0125838506 | ||
| 700 | 1 | |a Read, Ronald C. |4 edt | |
| 700 | 1 | |a Berge, Claude. | |
| 650 | 0 | |a Graph theory. | |
| 650 | 0 | |a Graph theory |x Data processing. | |
| 084 | |a 05Cxx (68-06) |2 msc2000 | ||
| 010 | |a 74187228 | ||
| 040 | |a DLC |c DLC |d DLC | ||
| 859 | |h 05 |i G766 |p A-4152 |b BIB. MATEMATICA | ||