Compartir
embeddability in graphs (en Inglés)
Liu Yanpei (Autor)
·
springer publishing map
· Libro Físico
embeddability in graphs (en Inglés) - liu yanpei
$ 122.070
$ 244.140
Ahorras: $ 122.070
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Miércoles 05 de Junio y el
Lunes 17 de Junio.
Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.
Reseña del libro "embeddability in graphs (en Inglés)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
✓ Producto agregado correctamente al carro, Ir a Pagar.
