Synopsis
Excerpt from A Linear Time Algorithm for Finding an Ambitus
An undirected graph is connected if there is a path connecting every pair of vertices and disconnected otherwise. The maximal connected subgraphs of G are its connected components or simply, components.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for A Linear Time Algorithm for Finding an Ambitus (Classic...
Stock Image
A Linear Time Algorithm for Finding an Ambitus (Classic Reprint)
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780656099030
Stock Image
A Linear Time Algorithm for Finding an Ambitus (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780656099030
Buy New
£ 22.43
£ 4.16 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available