Isbn: 9783030035983 - cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques (17 risultati)

xii, 107 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In.

Condizione: New.

Condizione: New. 1st ed. 2018 edition LISHERS AND DISTRIBUTORS PVT. LTD NO-PA16APR2015-KAP.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Brand New. 107 pages. 9.50x6.50x0.25 inches. In Stock.

Condizione: New.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book.This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.…

Condizione: new. Questo è un articolo print on demand.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizing big values of data to serve key applications, but also brings great challenges in computation. Using a consistent terminology, the book gives an excellent introduction to the models and algorithms for the problem of cohesive subgraph computation. The materials of this book are well organized from introductory content to more advanced topics while also providing well-designed source codes for most algorithms described in the book.This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation. 120 pp. Englisch.…

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes data structures that can be of general use for efficient graph processingConsidered the first extended survey on algorithms and techniques for efficient cohesive subgraph computationSourc.…

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This is a timely book for researchers who are interested in this topic and efficient data structure design for large sparse graph processing. It is also a guideline book for new researchers to get to know the area of cohesive subgraph computation.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 120 pp. Englisch.…