Embeddability in Graphs: 338 (Mathematics and Its Applications, 338) - Image 1

£89.35

Springer Embeddability in Graphs: 338 (Mathematics and Its Applications, 338)

Name: Embeddability in Graphs: 338 (Mathematics and Its Applications, 338)
Brand: Springer
Price: 89.35 GBP
Availability: InStock

Computer Science

Same price for 5 weeks. Today is much like next week.

£89 for 38 days straight · last change was Jan 2026

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 638 days • 638 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 638 days • 9 price levels

Days at Price

Current Price

Price Analysis

Most common price: £90 (249 days, 39.0%)

Price range: £80 - £104

Price levels: 9 different prices over 638 days

Description

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.

Product Specifications

Brand: Springer
Format: Hardcover
ASIN: 0792336488
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 31 March 1996
Listed Since: 15 December 2006

Barcode

No barcode data available

Springer Embeddability in Graphs: 338 (Mathematics and Its Applications, 338)

Same price for 5 weeks. Today is much like next week.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Graph Drawing and Network Visualization: 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers: 12868 (Lecture Notes in Computer Science, 12868)

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Graph and Network Theory: An Applied Approach using Mathematica®: 193 (Springer Optimization and Its Applications, 193)

Topics in Algorithmic Graph Theory: 178 (Encyclopedia of Mathematics and its Applications, Series Number 178)

Graphs & Digraphs (Textbooks in Mathematics)

Discrete and Computational Geometry, 2nd Edition

Graph-Based Modelling in Science, Technology and Art: 107 (Mechanisms and Machine Science, 107)

Exercises in Graph Theory: 19 (Texts in the Mathematical Sciences, 19)

Visualization and Mathematics III (Mathematics and Visualization)

Graph Structure Theory (Contemporary Mathematics): Proceedings of the Ams-Ims-Siam Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, With Support

Combinatorial and Computational Geometry: 52 (Mathematical Sciences Research Institute Publications, Series Number 52)

Nonlinear Computational Geometry: 151 (The IMA Volumes in Mathematics and its Applications, 151)

Combinatorial Geometry: 37 (Wiley Series in Discrete Mathematics and Optimization)

Surveys on Discrete and Computational Geometry: Twenty Years Later (Contemporary Mathematics)

Modern Graph Theory: 184 (Graduate Texts in Mathematics, 184)

Springer Graph-Based Modelling in Science, Tech and Art 107

Topics in Structural Graph Theory: 147 (Encyclopedia of Mathematics and its Applications, Series Number 147)

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Topological Methods in Data Analysis and Visualization V: Theory, Algorithms, and Applications (Mathematics and Visualization)

Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing

Graph Drawing and Network Visualization: 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers: 13764 (Lecture Notes in Computer Science, 13764)

Graphs, Networks and Algorithms: 5 (Algorithms and Computation in Mathematics, 5)

Discrete Geometry and Algebraic Combinatorics (Contemporary Mathematics): Ams Special Session Discrete Geometry and Algebraic Combinatorics January 11, 2013 San Diego, Ca

SCG 10 Proceedings of the 26th Annual Symposium on Computational Geometry