Hardcover. This book explores the expected parallel time and sequential space complexity of various graph and digraph problems. It provides an in-depth analysis of algorithms designed to solve these problems, focusing on their efficiency in terms of both time and space. The work is aimed at researchers and students in computer science, mathematics, and related fields who are interested in the theoretical aspects of computation and algorithm design.Key topics include graph theory, parallel processing, algorithm analysis, and computational complexity. The book offers a rigorous treatment of the subject, combining theoretical results with practical considerations. It serves as a valuable resource for understanding the fundamental limitations and possibilities of solving graph and digraph problems using parallel and sequential computing models.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.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

N� de ref. del art�culo 9781024185294

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Hardcover)
Editor: Hutson Street Press
Fecha de publicaci�n: 2025
Idioma: Ingl�s
ISBN 10: 102418529X
ISBN 13: 9781024185294
Encuadernaci�n: Hardcover
Estado: new

Acerca de

Sinopsis

This book explores the expected parallel time and sequential space complexity of various graph and digraph problems. It provides an in-depth analysis of algorithms designed to solve these problems, focusing on their efficiency in terms of both time and space. The work is aimed at researchers and students in computer science, mathematics, and related fields who are interested in the theoretical aspects of computation and algorithm design.

Key topics include graph theory, parallel processing, algorithm analysis, and computational complexity. The book offers a rigorous treatment of the subject, combining theoretical results with practical considerations. It serves as a valuable resource for understanding the fundamental limitations and possibilities of solving graph and digraph problems using parallel and sequential computing models.

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.

This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Online business

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

ABC BOOKS LIMITED
10 John Street, London, WC1N 2EB, United Kingdom

Condiciones de venta y env�o

Condiciones de venta

Orders can be returned within 30 days of receipt.

Derecho a cancelaci�n

Condiciones de env�o

Please note that titles are dispatched from our US, Canadian or Australian warehouses. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 7-14 days.

Tarifas de env�o de Reino Unido a Estados Unidos de America

Tarifas de env�o de Reino Unido a Estados Unidos de America
Cantidad del pedido	De 7 a 60 d�as h�biles	De 7 a 14 d�as h�biles
Primer art�culo	EUR 42.38	EUR 42.38

Los plazos de entrega los establecen los vendedores y var�an seg�n el transportista y la ubicaci�n. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relaci�n con cargos adicionales para cubrir cualquier aumento en los costes de env�o de los art�culos.