|
|
|
|
LEADER |
01727nam a2200385Ii 4500 |
001 |
DIGJCS0006 |
003 |
NyNyDIG |
008 |
141201s2011 sp a ob 000 0 spa d |
006 |
m o d |
007 |
cr ||||||||||| |
040 |
|
|
|a DGITA
|b eng
|e rda
|e pn
|c DGITA
|
020 |
|
|
|z 9789563060768
|
020 |
|
|
|z 9563060768
|
050 |
|
4 |
|a QA166 eBook
|
100 |
1 |
|
|a Moreno Araya, Eduardo Enrique,
|e author.
|
245 |
1 |
0 |
|a Grafos :
|b fundamentos y algoritmos /
|c Eduardo Moreno, Héctor Ramírez.
|
250 |
|
|
|a Primera edición.
|
264 |
|
1 |
|a [Santiago de Chile] :
|b J.C. Sáez editor,
|c [2011].
|
300 |
|
|
|a 1 online resource (124 pages) :
|b illustrations.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Herramientas para la formación de profesores de matemáticas
|
588 |
|
|
|a Online resource; title from PDF title page (Digitalia, viewed January 9, 2015)
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
|
|a Introducción a los algoritmos -- Grafos -- Árbol recubridor de costo mínimo -- Camino más corto -- Flujo en redes: problema de flujo máximo -- Ciclos.
|
650 |
|
0 |
|a Graph theory.
|
655 |
|
0 |
|a Electronic books.
|
700 |
1 |
|
|a Ramírez Cabrera, Héctor Ariel,
|e author.
|
776 |
0 |
8 |
|i Print version:
|a Moreno Araya, Eduardo Enrique.
|t Grafos.
|d [Santiago de Chile] : J.C. Sáez editor, [2011]
|z 9789563060768
|
793 |
0 |
|
|g Digitalia eBook Collection:
|a J.C. Sáez editor
|
791 |
2 |
|
|a Digitalia (Firm)
|e distributor.
|
830 |
|
0 |
|a Herramientas para la formación de profesores de matemáticas.
|
856 |
4 |
0 |
|3 Digitalia Hispánica
|u http://www.digitaliapublishing.com/a/13545/
|
910 |
|
|
|a Premium Collection: 2014
|