國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithmic graph theory and perfect...

Golumbic, Martin Charles.

Algorithmic graph theory and perfect graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithmic graph theory and perfect graphsMartin Charles Golumbic.
作者:	Golumbic, Martin Charles.
出版者:	Amsterdam ;Elsevier,2004.
面頁冊數:	xxvi, 314 p. :ill. ;25 cm.
叢書名:	Annals of discrete mathematics ;
標題:	Perfect graphs.
電子資源:	An electronic book accessible through the World Wide Web; click for information
電子資源:	http://www.loc.gov/catdir/enhancements/fy0621/2004555477-d.html
ISBN:	9780444515308

Algorithmic graph theory and perfect graphs
Golumbic, Martin Charles.

Algorithmic graph theory and perfect graphs[electronic resource] /Martin Charles Golumbic. - Amsterdam ;Elsevier,2004. - xxvi, 314 p. :ill. ;25 cm. - Annals of discrete mathematics ;57.

Includes bibliographies and index.

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory Beautifully written for the new mathematician or computer scientist Comprehensive treatment.

Electronic reproduction.
Amsterdam :
Elsevier Science & Technology,
2007.

Mode of access: World Wide Web.

ISBN: 9780444515308

Source: 108382:108427Elsevier Science & Technologyhttp://www.sciencedirect.comSubjects--Topical Terms:

206428
Perfect graphs.
Index Terms--Genre/Form:

214472
Electronic books.

LC Class. No.: QA166 / .G64 2004eb

Dewey Class. No.: 511/.5

Algorithmic graph theory and perfect graphs
LDR:02604cmm 2200337Ia 4500 001 256586
003 OCoLC
005 20100729101520.0
006 m d
007 cr cn|||||||||
008 100818s2004 ne a ob 001 0 eng d
020 $a 9780444515308
020 $a 0444515305
029 1 $a NZ1 $b 12433599
035 $a (OCoLC)162579997
035 $a ocn162579997
037 $a 108382:108427 $b Elsevier Science & Technology $n http://www.sciencedirect.com
040 $a OPELS $c OPELS
049 $a TEFA
050 1 4 $a QA166 $b .G64 2004eb
082 0 4 $a 511/.5 $2 22
100 1 $a Golumbic, Martin Charles. $3 254168
245 1 0 $a Algorithmic graph theory and perfect graphs $h [electronic resource] / $c Martin Charles Golumbic.
260 $a Amsterdam ; $a Boston : $b Elsevier, $c 2004.
300 $a xxvi, 314 p. : $b ill. ; $c 25 cm.
440 0 $a Annals of discrete mathematics ; $v 57
504 $a Includes bibliographies and index.
520 $a Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory Beautifully written for the new mathematician or computer scientist Comprehensive treatment.
533 $a Electronic reproduction. $b Amsterdam : $c Elsevier Science & Technology, $d 2007. $n Mode of access: World Wide Web. $n System requirements: Web browser. $n Title from title screen (viewed on Aug. 2, 2007). $n Access may be restricted to users at subscribing institutions.
650 0 $a Perfect graphs. $3 206428
650 7 $a Teoria dos grafos. $2 larpcal $3 453949
650 7 $a Computabilidade e complexidade. $2 larpcal $3 453950
650 7 $a Programa�c�ao matem�atica. $2 larpcal $3 340808
650 7 $a Programa�c�ao inteira e fluxos em rede. $2 larpcal $3 453951
650 1 7 $a Grafentheorie. $2 gtt $3 272777
650 6 $a Graphes parfaits. $3 453952
655 7 $a Electronic books. $2 local. $3 214472
710 2 $a ScienceDirect (Online service) $3 307425
776 1 $c Original $z 0444515305 $z 9780444515308 $w (DLC) 2004555477 $w (OCoLC)55081039
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/publication?issn=01675060&volume=57 $z An electronic book accessible through the World Wide Web; click for information
856 4 2 $3 Publisher description $u http://www.loc.gov/catdir/enhancements/fy0621/2004555477-d.html
994 $a C0 $b TEF