9781333432713 - counting embeddings of planar graphs using dfs trees (classic reprint) di cai, jiazhen (3 risultati)
- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,39
Spedizione gratuitaSpedito in U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,27
EUR 3,84 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 15 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Altre immagini- Brossura
- Print on Demand
Da: Forgotten Books, London, Regno UnitoForgotten Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 15,32
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: 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… and 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.
