A Linear Time Algorithm for Finding an Ambitus (Classic Reprint) - Hardcover

Mishra, B.

Hardcover

ISBN 10: 0656099038 ISBN 13: 9780656099030

Verlag: Forgotten Books, 2019

Inhaltsangabe

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.

Details zur Ausgabe

• Verlag: Forgotten Books
• Erscheinungsdatum: 2019
• Sprache: Englisch
• ISBN 10: 0656099038
• ISBN 13: 9780656099030
• Einband: Tapa dura
• Anzahl der Seiten: 60
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Nicht verfügbar