| Record ID | harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:283324357:1573 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.00.20150123.full.mrc:283324357:1573?format=raw |
LEADER: 01573pam a2200337 a 4500
001 000371911-1
005 20020606090541.3
008 820203s1984 enka b 00110 eng
010 $a 82001975
020 $a0471103748 :$c$103.25
035 0 $aocm08195181
040 $aDLC$cDLC
041 1 $aengfre
050 00 $aQA166$b.G6513 1984
100 1 $aGondran, Michel.
240 10 $aGraphes et algorithmes.$lEnglish
245 10 $aGraphs and algorithms /$cMichel Gondran and Michel Minoux ; translated by Steven Vajda.
260 0 $aChichester [West Sussex] ;$aNew York :$bWiley,$cc1984.
300 $axix, 650 p. :$bill. ;$c25 cm.
440 0 $aWiley-Interscience series in discrete mathematics
500 $aTranslation of: Graphes et algorithmes.
500 $a"A Wiley-Interscience publication."
504 $aIncludes bibliographies and index.
505 0 $aGeneralities about graphs -- The shortest path problem in a graph -- Path algebras -- Trees and arborescences -- Flows and transportation networks -- Flows with gains, multicommodity flows -- Matchings and ♭-matchings -- Eulerian and hamiltonian walks -- Matroids -- Non-polynomial problems -- Branch and bound algorithms -- Approximate algorithms.
650 0 $aGraph theory$xData processing.
650 0 $aAlgorithms.
650 0 $aComputer algorithms.
700 1 $aMinoux, Michel.
776 08 $iOnline version:$aGondran, Michel.$sGraphes et algorithmes. English.$tGraphs and algorithms.$dChichester [West Sussex] ; New York : Wiley, ©1984$w(OCoLC)557566103
988 $a20020608
906 $0DLC