9781333432713 - counting embeddings of planar graphs using dfs trees (classic reprint) von cai, jiazhen (3 Ergebnisse)
- Softcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 24,39
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 24,27
EUR 3,84 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Weitere Bilder- Softcover
- Print-on-Demand
Anbieter: Forgotten Books, London, Vereinigtes KönigreichForgotten Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 15,32
Versand gratisVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Paperback. Zustand: New. Print on Demand. This book studies the methods used to count planar graphs, an important class of graphs in mathematics and computer science. The author explores a variety of approaches, resulting in new formulas and algorithms that improve the efficiency of counting embeddings, specifically connected an…d unconnected graphs. This work builds on existing research in graph theory and contributes to the body of knowledge on algorithms for graph problems. By investigating planar graphs and their embeddings, the author provides valuable insights into the mathematical structures of graphs and advances the understanding of planar graph problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
