Tolerance graphs
著者
書誌事項
Tolerance graphs
(Cambridge studies in advanced mathematics, 89)
Cambridge University Press, 2004
- : hardback
大学図書館所蔵 全49件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. 253-259) and indexes
内容説明・目次
内容説明
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.
目次
- 1. Introduction
- 2. Early work on tolerance graphs
- 3. Trees, cotrees and bipartite graphs
- 4. Interval probe graphs
- 5. Bitolerance graphs and ordered sets
- 6. Unit and 50% tolerance graphs
- 7. Comparability and invariance results
- 8. Bounded bitolerance recognition
- 9. Algorithms on tolerance graphs
- 10. The hierarchy of bitolerance orders
- 11. Tolerance models on trees
- 12. Phi-tolerance models
- 13. Directed tolerance graphs
- 14. Open questions and further directions.
「Nielsen BookData」 より