Planar Maps, Random Walks and Circle Packing
Overview & Synopsis
A planar map is a graph that can be drawn in the plane without crossing edges, together with a specification of the cyclic ordering of the edges incident to each vertex.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Planar Maps, Random Walks and Circle Packing |
|---|---|
| Author / Organization | Asaf Nachmias |
| Subject & Discipline | Graph Theory, Algorithms and Data Structures, Combinatorics and Game Theory, Discrete and Finite Mathematics, Operations Research (OR), Linear Programming, Optimization, and Approximation |
| Categories | Graph Theory |
| Publication Year | 2020 |
| ISBN | 3030279677 |
| License / Rights | Creative Commons License (CC) |
| Resource Verification | Access Restricted / Protected Host |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-103330 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Planar Maps, Random Walks and Circle Packing • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.