LEADER 03398nam  22006492  450 
001 9910457917403321
005 20151005020621.0
010   $a1-107-14728-X
010   $a1-280-44950-0
010   $a9786610449507
010   $a0-511-18563-4
010   $a0-511-18480-8
010   $a0-511-18745-9
010   $a0-511-31356-X
010   $a0-511-54298-4
010   $a0-511-18652-5
035   $a(CKB)1000000000353369
035   $a(EBL)256682
035   $a(OCoLC)319033335
035   $a(SSID)ssj0000259944
035   $a(PQKBManifestationID)11193392
035   $a(PQKBTitleCode)TC0000259944
035   $a(PQKBWorkID)10191356
035   $a(PQKB)11104111
035   $a(UkCbUP)CR9780511542985
035   $a(MiAaPQ)EBC256682
035   $a(Au-PeEL)EBL256682
035   $a(CaPaEBR)ebr10124740
035   $a(CaONFJC)MIL44950
035   $a(EXLCZ)991000000000353369
100   $a20090505d2004||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aTolerance graphs /$fMartin Charles Golumbic, Ann N. Trenk$b[electronic resource]
210  1$aCambridge :$cCambridge University Press,$d2004.
215   $a1 online resource (xii, 265 pages) $cdigital, PDF file(s)
225 1 $aCambridge studies in advanced mathematics ;$v89
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311   $a0-521-82758-2 
320   $aIncludes bibliographical references (p. 253-259) and indexes.
327   $aIntroduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions.
330   $aThe 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.
410  0$aCambridge studies in advanced mathematics ;$v89.
606   $aGraph theory
615  0$aGraph theory.
676   $a511.5
700   $aGolumbic$b Martin Charles$0104097
702   $aTrenk$b Ann N.
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910457917403321
996   $aTolerance graphs$92451118
997   $aUNINA