東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graphs, networks and algorithms /

Jungnickel, D. (1952-)

FindBook

Google Book

Amazon

博客來

Graphs, networks and algorithms /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graphs, networks and algorithms // Dieter Jungnickel.
作者:	Jungnickel, D.
出版者:	Berlin ;Springer, : c2008.,
面頁冊數:	xix, 650 p. :ill. ;24 cm.
叢書名:	Algorithms and computation in mathematics,
內容註:	Basic graph theory -- Algorithms and complexity -- Shortest paths -- Spanning trees -- The greedy algorithm -- Flows -- Combinatorial applications -- Connectivity and depth first search -- Colourings -- Circulations -- The network simplex algorithm -- Synthesis of networks -- Matchings -- Weighted matchings -- A Hard Problem: the TSP -- Some NP-complete problems -- Solutions -- List of sympols.
標題:	Combinatorial optimization. -
ISBN:	9783540727798 :

Graphs, networks and algorithms /
Jungnickel, D.1952-

Graphs, networks and algorithms /Dieter Jungnickel. - 3rd ed. - Berlin ;Springer,c2008. - xix, 650 p. :ill. ;24 cm. - Algorithms and computation in mathematics,v. 51431-1550 ;. - Algorithms and computation in mathematics,v. 5.

Includes bibliographical references (p. [601]-633) and index.

Basic graph theory -- Algorithms and complexity -- Shortest paths -- Spanning trees -- The greedy algorithm -- Flows -- Combinatorial applications -- Connectivity and depth first search -- Colourings -- Circulations -- The network simplex algorithm -- Synthesis of networks -- Matchings -- Weighted matchings -- A Hard Problem: the TSP -- Some NP-complete problems -- Solutions -- List of sympols.

ISBN: 9783540727798 :EUR64.95

LCCN: 2007929271Subjects--Topical Terms:

544215
Combinatorial optimization.

LC Class. No.: QA402.5 / .J8913 2008

Dewey Class. No.: 511.5

Graphs, networks and algorithms /
LDR:01404cam 2200313 a 450 001 872882
003 OCoLC
005 20100814153924.0
008 100814s2008 gw a b 001 0 eng
010 $a 2007929271
020 $a 9783540727798 : $c EUR64.95
020 $a 3540727795
029 1 $a OHX $b har070060892
029 1 $a AU@ $b 000042952345
029 1 $a NZ1 $b 11620236
035 $a 00512384
040 $a DLC $c DLC $d AU@ $d BAKER $d BTCTA $d CUY $d MUQ $d NDHU $d OCLCG $d OHX $d SOI $d TXH $d YDXCP
041 1 $a eng $h ger
049 $a FISA
050 0 0 $a QA402.5 $b .J8913 2008
082 0 4 $2 22 $a 511.5
100 1 $a Jungnickel, D. $q (Dieter), $d 1952- $3 1041614
240 1 0 $a Graphen, Netzwerke und Algorithmen. $l English
245 1 0 $a Graphs, networks and algorithms / $c Dieter Jungnickel.
250 $a 3rd ed.
260 $a Berlin ; $a New York : $c c2008. $b Springer,
300 $a xix, 650 p. : $b ill. ; $c 24 cm.
440 1 $a Algorithms and computation in mathematics, $v v. 5 $x 1431-1550 ;
504 $a Includes bibliographical references (p. [601]-633) and index.
505 0 $a Basic graph theory -- Algorithms and complexity -- Shortest paths -- Spanning trees -- The greedy algorithm -- Flows -- Combinatorial applications -- Connectivity and depth first search -- Colourings -- Circulations -- The network simplex algorithm -- Synthesis of networks -- Matchings -- Weighted matchings -- A Hard Problem: the TSP -- Some NP-complete problems -- Solutions -- List of sympols.
650 0 $a Combinatorial optimization. $3 544215
650 0 $a Graph theory. $3 523815
809 $d QA402.5 $e J8913 $p BOOK $y 2008
830 0 $a Algorithms and computation in mathematics, $x 1431-1550 ; $v v. 5 $3 1041615