## Find a copy online

### Links to this item

public.eblib.com Click here to view book

## Find a copy in the library

Finding libraries that hold this item...

## Details

Material Type: | Document, Internet resource |
---|---|

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Jeremy P Spinrad |

ISBN: | 9780821828151 0821828150 |

OCLC Number: | 956663262 |

Notes: | Title from content provider. |

Description: | 1 online resource. |

Contents: | Explanatory remarks Chapter 1. Introduction Chapter 2. Implicit representation Chapter 3. Intersection and containment representations Chapter 4. Real numbers in graph representations Chapter 5. Classes which use global information Chapter 6. Visibility graphs Chapter 7. Intersection of graph classes Chapter 8. Graph classes defined by forbidden subgraphs Chapter 9. Chordal bipartite graphs Chapter 10. Matrices Chapter 11. Decomposition Chapter 12. Elimination schemes Chapter 13. Recognition algorithms Chapter 14. Robust algorithms for optimization problems Chapter 15. Characterization and construction Chapter 16. Applications |

Responsibility: | Spinrad, Jeremy P. |

### Abstract:

The book deals with questions which 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. T.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Efficient graph representations".
Be the first.