| Record ID | marc_loc_updates/v38.i12.records.utf8:13465165:1198 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v38.i12.records.utf8:13465165:1198?format=raw |
LEADER: 01198cam a2200301 a 4500
001 2009012805
003 DLC
005 20100316172424.0
008 090331s2009 riua b 100 0 eng
010 $a 2009012805
020 $a9780821843833 (alk. paper)
020 $a0821843834 (alk. paper)
035 $a(OCoLC)ocn318057854
040 $aDLC$cDLC$dYDX$dYDXCP$dBTCTA$dBWX$dDLC
050 00 $aQA402.5$b.S5425 2009
082 00 $a519.6/4$222
245 04 $aThe shortest path problem :$bninth DIMACS implementation challenge /$cCamil Demetrescu, Andrew V. Goldberg, David S. Johnson, editors.
260 $aProvidence, R.I. :$bAmerican Mathematical Society,$cc2009.
300 $axii, 319 p. :$bill. ;$c27 cm.
490 1 $aDIMACS series in discrete mathematics and theoretical computer science ;$vv. 74
504 $aIncludes bibliographical references.
650 0 $aCombinatorial optimization$vCongresses.
650 0 $aGraph theory$xMathematics$vCongresses.
650 0 $aAlgorithms$vCongresses.
700 1 $aDemetrescu, Camil.
700 1 $aGoldberg, Andrew V.
700 1 $aJohnson, David S.,$d1945-
830 0 $aDIMACS series in discrete mathematics and theoretical computer science ;$vv. 74.