Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Sudwestdeutscher Verlag Fur Hochschulschriften AG, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: Ergodebooks, Houston, TX, U.S.A.
Book
Softcover. Condition: New. An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory being able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes. Here, random access is very time-consuming. To tackle massive graphs stored on external memories, the semi-streaming model has been proposed. It permits a working memory of restricted size and forbids random access to G. In contrast, the input is assumed to be a stream of edges in arbitrary order. In this book we develop algorithms in the semi-streaming model approaching different graph problems. For the problems of testing graph connectivity and bipartiteness and for the computation of a minimum spanning tree, we show how to obtain optimal running times. For the intractable problem of finding a maximum weighted matching, we present the best known approximation algorithm. Finally, we show the minimum and the maximum cut problem in a graph both to be intractable in the semi-streaming model and give algorithms that approximate respective solutions in a randomized fashion.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Book Print on Demand
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Sudwestdeutscher Verlag fur Hochschulschrifte 2009-09, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: Chiron Media, Wallingford, United Kingdom
Book
PF. Condition: New.
Published by Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Sep 2015, 2015
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory being able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes. Here, random access is very time-consuming. To tackle massive graphs stored on external memories, the semi-streaming model has been proposed. It permits a working memory of restricted size and forbids random access to G. In contrast, the input is assumed to be a stream of edges in arbitrary order. In this book we develop algorithms in the semi-streaming model approaching different graph problems. For the problems of testing graph connectivity and bipartiteness and for the computation of a minimum spanning tree, we show how to obtain optimal running times. For the intractable problem of finding a maximum weighted matching, we present the best known approximation algorithm. Finally, we show the minimum and the maximum cut problem in a graph both to be intractable in the semi-streaming model and give algorithms that approximate respective solutions in a randomized fashion. 72 pp. Deutsch.
Published by Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book Print on Demand
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory being able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memories and that can only be stored on disks or even tapes. Here, random access is very time-consuming. To tackle massive graphs stored on external memories, the semi-streaming model has been proposed. It permits a working memory of restricted size and forbids random access to G. In contrast, the input is assumed to be a stream of edges in arbitrary order. In this book we develop algorithms in the semi-streaming model approaching different graph problems. For the problems of testing graph connectivity and bipartiteness and for the computation of a minimum spanning tree, we show how to obtain optimal running times. For the intractable problem of finding a maximum weighted matching, we present the best known approximation algorithm. Finally, we show the minimum and the maximum cut problem in a graph both to be intractable in the semi-streaming model and give algorithms that approximate respective solutions in a randomized fashion.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Book Print on Demand
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2015
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. An algorithm solving a graph problem is usually expected to have fast random access to the input graph G and a working memory being able to store G completely. These powerful assumptions are put in question by massive graphs that exceed common working memor.
Published by Südwestdeutscher Verlag für Hochschulschriften, 2009
ISBN 10: 383810806XISBN 13: 9783838108063
Seller: dsmbooks, Liverpool, United Kingdom
Book
Paperback. Condition: Like New. Like New. book.