Algorithm maximal planar subgraph de jiazhen cai (6 resultados)

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

Condición: New.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: 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.…

Condición: New. Print on Demand pp. 32.