๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Graph Classes: A Survey

โœ Scribed by Andreas Brandstรคdt, Van Bang Le, Jeremy P. Spinrad


Publisher
Society for Industrial Mathematics
Year
1987
Tongue
English
Leaves
321
Series
Monographs on Discrete Mathematics and Applications
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Graph Classes: A Survey (Monographs on D
โœ Andreas Brandstรคdt, Van Bang Le, Jeremy P. Spinrad ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors s

Graph Classes: A Survey (Monographs on D
โœ Andreas Brandstรคdt, Van Bang Le, Jeremy P. Spinrad ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors s

Graph Classes: A Survey (Monographs on D
โœ Andreas Brandstรคdt, Van Bang Le, Jeremy P. Spinrad ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors s

Spectral Graph Drawing: A Survey
โœ Thomas Puppe ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› VDM Verlag ๐ŸŒ English

Graph Drawing is the science of finding an intuitive visualization of a network (or in mathematical terms of a graph). One approach is to define energy functions that represent design criteria for graph layouts. It happens to be that the eigenvalues of graph related matrices are locally optimal solu