Order Total (1 Item Items):
Shipping Destination:
Efficient Parallel Biconnectivity Algorithm by Tarjan Robert (8 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (8)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (8)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (6)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
An Efficient Parallel Biconnectivity Algorithm (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 23.99
US$ 4.44 shipping
Ships from United Kingdom to U.S.A.Quantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
US$ 17.29
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book presents a new, highly efficient, parallel algorithm for finding the blocks (biconnected components) of an undirected graph - an important problem in graph theory. The algorithm has a linear-time sequential implementation and parallel implementations with optimal speed-up, making it suitable for large-scale graph analysis. The author, an established expert in graph algorithms, provides a clear and comprehensive explanation of the algorithm, making the book accessible to both researchers and practitioners in the field. By delving into the intricacies of parallel graph algorithms, the book contributes to the ongoing development of efficient methods for analyzing complex data structures. 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.
-
An Efficient Parallel Biconnectivity Algorithm
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
US$ 87.31
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New.
-
Gebunden. Condition: New.
-
An Efficient Parallel Biconnectivity Algorithm
Language: English
Published by Creative Media Partners, LLC Aug 2015, 2015
ISBN 10: 1340294494 ISBN 13: 9781340294496
Buch. Condition: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.
-
US$ 68.82
US$ 87.81 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New.
-
An Efficient Parallel Biconnectivity Algorithm
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 69.36
US$ 18.05 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 261.
