國立虎尾科技大學 |

Tolerance graphs /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Tolerance graphs // Martin Charles Golumbic, Ann N. Trenk.
作者:	Golumbic, Martin Charles,
其他作者:	Trenk, Ann N.,
面頁冊數:	1 online resource (xii, 265 pages) :digital, PDF file(s). :
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Graph theory. -
電子資源:	https://doi.org/10.1017/CBO9780511542985
ISBN:	9780511542985 (ebook)

Tolerance graphs /
Golumbic, Martin Charles,

Tolerance graphs /Martin Charles Golumbic, Ann N. Trenk. - 1 online resource (xii, 265 pages) :digital, PDF file(s). - Cambridge studies in advanced mathematics ;89. - Cambridge studies in advanced mathematics ;134..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.

ISBN: 9780511542985 (ebook)Subjects--Topical Terms:

527884
Graph theory.

LC Class. No.: QA166 / .G645 2004

Dewey Class. No.: 511.5

Tolerance graphs /
LDR:01970nam a2200289 i 4500 001 1126539
003 UkCbUP
005 20151005020621.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2004||||enk o ||1 0|eng|d
020 $a 9780511542985 (ebook)
020 $z 9780521827584 (hardback)
035 $a CR9780511542985
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 4 $a QA166 $b .G645 2004
082 0 4 $a 511.5 $2 22
100 1 $a Golumbic, Martin Charles, $e author. $3 1445417
245 1 0 $a Tolerance graphs / $c Martin Charles Golumbic, Ann N. Trenk.
264 1 $a Cambridge : $b Cambridge University Press, $c 2004.
300 $a 1 online resource (xii, 265 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
490 1 $a Cambridge studies in advanced mathematics ; $v 89
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.
650 0 $a Graph theory. $3 527884
700 1 $a Trenk, Ann N., $e author. $3 1445418
776 0 8 $i Print version: $z 9780521827584
830 0 $a Cambridge studies in advanced mathematics ; $v 134. $3 1133579
856 4 0 $u https://doi.org/10.1017/CBO9780511542985