Efficient graph representations
著者
書誌事項
Efficient graph representations
（Fields Institute monographs, 19）
American Mathematical Society, c2003
大学図書館所蔵 件 / 全25件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 319-336) and index
内容説明・目次
内容説明
This monograph is the first to deal with graph representation as a field of study. It is written from both a mathematical and computer science perspective. Synthesizing the two traditions opens a number of interesting new research areas. Some individual classes of graphs are important but are not adequately covered in any current text. This book gives a much more current view of important algorithmic developments in intersection graph classes than is currently available and includes a large number of new open problems. It deals with the questions that arise from storing a graph in a computer. Different classes of graphs admit different forms of computer representations, and focusing on the representations gives a new perspective on a number of problems.For a variety of classes of graphs, the book considers such questions as existence of good representations, algorithms for finding representations, questions of characterizations in terms of representation, and how the representation affects the complexity of optimization problems. General models of efficient computer representations are also considered. The book is designed to be used both as a text for a graduate course on topics related to graph representation and as a monograph for anyone interested in research in the field of graph representation. The material is of interest both to those focusing purely on graph theory and to those working in the area of graph algorithms.
目次
Explanatory remarks Introduction Implicit representation Intersection and containment representations Real numbers in graph representations Classes which use global information Visibility graphs Intersection of graph classes Graph classes defined by forbidden subgraphs Chordal bipartite graphs Matrices Decomposition Elimination schemes Recognition algorithms Robust algorithms for optimization problems Characterization and construction Applications Glossary Survey of results on graph classes Bibliography Index.
「Nielsen BookData」 より