Artículos relacionados a Embeddability in Graphs: 338 (Mathematics and Its Applicatio...

Embeddability in Graphs: 338 (Mathematics and Its Applications, 338) - Tapa dura

Liu Yanpei

 
9780792336488: Embeddability in Graphs: 338 (Mathematics and Its Applications, 338)
Tapa dura
ISBN 10: 0792336488 ISBN 13: 9780792336488
Editorial: Springer, 1996

Sinopsis

This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable.
At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable.
At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1996
Idioma
Inglés
ISBN 10 
0792336488
ISBN 13 
9780792336488
Encuadernación
Tapa dura
Número de páginas
420
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9789048145997: Embeddability in Graphs: 338 (Mathematics and Its Applications)

Edición Destacada

ISBN 10:  9048145996 ISBN 13:  9789048145997
Editorial: Springer, 2010
Tapa blanda