LEADER 02087nam0 22005293i 450 001 VAN0277578 005 20240610024337.232 017 70$2N$a9783031038570 100 $a20240610d2022 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aGraph and Network Theory$eAn Applied Approach using Mathematica®$fMichael A. Henning, Jan H. van Vuuren 210 $aCham$cSpringer$d2022 215 $axxix, 766 p.$cill.$d24 cm 410 1$1001VAN0067197$12001 $aSpringer optimization and its applications$1210 $aBerlin [etc.]$cSpringer$d2006-$v193 610 $aAlgorithmic complexity$9KW:K 610 $aDomination in graphs$9KW:K 610 $aEulerian graphs$9KW:K 610 $aExtremal graph theory$9KW:K 610 $aGraph coloring$9KW:K 610 $aGraph connectedness$9KW:K 610 $aGraph theory$9KW:K 610 $aHamiltonian graphs$9KW:K 610 $aLocation problems$9KW:K 610 $aMathematica exercises$9KW:K 610 $aMaximum flow networks$9KW:K 610 $aMinimum spanning trees$9KW:K 610 $aNP-completeness$9KW:K 610 $aNetwork optimisation$9KW:K 610 $aOptimal paths$9KW:K 610 $aOriented graphs$9KW:K 610 $aPlanarity$9KW:K 610 $aRamsey theory$9KW:K 610 $aZarankiewicz numbers$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aHenning$bMichael A.$3VANV204335$0853538 701 1$aVuuren$bJan H. van$3VANV230028$01739944 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240621$gRICA 856 4 $uhttps://doi.org/10.1007/978-3-031-03857-0$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0277578 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-Book 8744 $e08eMF8744 20240618 996 $aGraph and Network Theory$94164600 997 $aUNICAMPANIA