Articles liés à An O(m Log N) Time Algorithm for the Maximal Planar...
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem (Classic Reprint) - Couverture souple
- ÉditeurForgotten Books
- Date d'édition2024
- ISBN 10 133217289X
- ISBN 13 9781332172894
- ReliureBroché
- Langueanglais
- Nombre de pages35
Acheter neuf
Afficher cet article
EUR 14,13
Gratuit expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délais
Résultats de recherche pour An O(m Log N) Time Algorithm for the Maximal Planar...
Image fournie par le vendeur
An O(m Log N) Time Algorithm for the Maximal Planar Subgraph Problem
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9781332172894_0
Quantité disponible : Plus de 20 disponibles
Image d'archives
An Om Log N Time Algorithm for the Maximal Planar Subgraph Problem Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332172894
Quantité disponible : 15 disponible(s)