Extremal paths in graphs : foundations, search strategies, and related topics

＜図書＞
Extremal paths in graphs : foundations, search strategies, and related topics

責任表示	Ulrich Huckenbeck
シリーズ	Mathematical topics ; v. 10
データ種別	図書
版	1st ed
出版情報	Berlin : Akademie Verlag , c1997
本文言語	英語
大きさ	480 p. ; 25 cm
概要	This book examines the central problem of searching for optimal paths in graphs--the search for the shortest connection from one place to another one in a city, for example. It investigates generalize... versions of the Dijkstra algorithm & the Ford-Bellman algorithm. These generalized search strategies find paths with minimum or almost minimum costs even if the cost function is not computed by adding costs of the edges of a path. The book describes many types of optimal path problems including the search for optimal paths in random graphs or NP-complete optimal path problems like the Traveling Salesman Problem. It also studies structural properties of cost measures for paths in graphs; in particular, generalized versions of additivity, Bellman properties, & order preservation of cost functions. 続きを見る

状態	巻次	所蔵場所	請求記号	刷年	文庫名称	資料番号	コメント	予約・取寄	複写申込	自動書庫
		中央図自動書庫	415.7/H 98/1	1997		017211997014932		予約・取寄		出庫可能	予約・取寄		出庫可能
		理系図3F 数理独自	HUCK/10/1	1997		023211997007481		予約・取寄			予約・取寄

一般注記	Includes bibliography (p. [447]-474) and index
著者標目	*Huckenbeck, Ulrich
件　名	LCSH:Paths and cycles (Graph theory) LCSH:Combinatorial optimization
書誌ID	1000296814
ISBN	3055016580
NCID	BA31170020
巻冊次	ISBN:3055016580
登録日	2009.09.11
更新日	2009.11.02