Articles liés à Embeddability in Graphs

Embeddability in Graphs - Couverture rigide

Liu Yanpei

 
9780792336488: Embeddability in Graphs
Couverture rigide
ISBN 10 : 0792336488 ISBN 13 : 9780792336488
Editeur : Kluwer Academic Publishers, 1996

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Kluwer Academic Publishers
Date d'édition
1996
Langue
anglais
ISBN 10 
0792336488
ISBN 13 
9780792336488
Reliure
Relié
Nombre de pages
414
Coordonnées du fabricant
non disponible
Personne responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Autres éditions populaires du même titre

9789048145997: Embeddability in Graphs

Edition présentée

ISBN 10 :  9048145996 ISBN 13 :  9789048145997
Editeur : Springer, 2010
Couverture souple