Embeddability in Graphs - Mathematics and Its Applications - Liu Yanpei - Bøker - Springer - 9789048145997 - 4. desember 2010
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Embeddability in Graphs - Mathematics and Its Applications 1st Ed. Softcover of Orig. Ed. 1996 edition

Liu Yanpei

Pris
NZD 179,50

Bestillingsvarer

Forventes levert 31. jul - 8. aug
Legg til iMusic ønskeliste
Eller

Finnes også som:

Embeddability in Graphs - Mathematics and Its Applications 1st Ed. Softcover of Orig. Ed. 1996 edition

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.


416 pages, black & white illustrations

Media Bøker     Pocketbok   (Bok med mykt omslag og limt rygg)
Utgitt 4. desember 2010
ISBN13 9789048145997
Utgivere Springer
Antall sider 416
Mål 156 × 234 × 21 mm   ·   580 g
Språk Engelsk  

Vis alle

Mer med Liu Yanpei