Cai jiazhen (14 risultati)

Paperback or Softback. Condizione: New. An O(n log n) Algorithm for the Maximal Planar Subgraph Problem. Book.

Condizione: New.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

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.…

Paperback. Condizione: New. Print on Demand. This book presents an efficient algorithm for finding a maximal planar subgraph, pushing the boundaries of existing algorithms in this area. The maximal planar subgraph problem involves finding a subset of edges in a graph that can be removed to make the graph planar, with the goal of removing as few edges as possible. The author introduces a novel approach based on a modified version of Hopcroft and Tarjan's planarity testing algorithm, resulting in an algorithm with a time complexity of O(m log n), where m is the number of edges and n is the number of vertices in the graph. The book provides a clear and thorough explanation of the algorithm, making it accessible to readers with a background in graph theory and algorithms. By introducing this new approach, the author contributes to the ongoing research in graph algorithms and offers a valuable tool for solving problems involving the planarity of graphs. 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.…

Paperback. Condizione: New. Print on Demand. This insightful book delves into pattern matching algorithms, an essential area within programming language systems, for tasks such as program editing and optimizing compilers. The author builds on foundational work in this field to provide asymptotically improved algorithms for both time and space during pattern matching. The book's accessible and comprehensive approach makes it well-suited for a wide audience, from students to practitioners seeking to expand their knowledge of pattern matching algorithms. The author meticulously describes each algorithm, proving theoretical improvements and demonstrating their practical advantages through empirical data. By offering a space/time tradeoff, the book empowers readers to tailor their approach to specific problem instances. Furthermore, the book explores a subclass of patterns where the author presents an algorithm that significantly reduces space utilization while maintaining efficient time complexity. This book not only advances the theoretical understanding of pattern matching algorithms but also provides valuable insights for practical applications in various domains. Its rigorous analysis and clear explanations make it an indispensable resource for anyone seeking to enhance their expertise in this crucial field. 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.…

Condizione: New. Print on Demand pp. 32.