Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Embeddability in Graphs
Angielski
249 b
Nawet do 30 dni na zwrot
Klienci kupili także
/
Miękka
46.63
zł
/
Miękka
184.53
zł
/
Miękka
69.60
zł
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
48.47
zł
/
Miękka
67.15
zł
/
Miękka
169.22
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?