Order Total (1 Item Items):
Shipping Destination:
Graphs Data Structures Algorithms (28 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (28)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (18)
- As New, Fine or Near Fine (5)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (2)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (21)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Python Data Structures and Algorithms: Improve application performance with graphs, stacks, and queues
Language: English
Published by Packt Publishing (edition ), 2017
ISBN 10: 1786467356 ISBN 13: 9781786467355
Paperback. Condition: Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
-
Paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Softcover. Condition: Très bon. Ancien livre de bibliothèque avec équipements. Edition 1979. Tome 13. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1979. Volume 13. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
paperback. Condition: Like New. Ships in a BOX from Central Missouri! Like Brand NEW. No tears, highlighting or writing because it's never been used! May have minor shelf wear. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
-
paperback. Condition: New. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
-
-
-
Graphs, data structures, algorithms : proceedings of Workshop WG 78 on Graphtheoretic Concepts in Computer Science, Erlangen, Germany. Applied computer science ; 13
Language: English
Published by München, Wien : Hanser, 1979
ISBN 10: 3446127488 ISBN 13: 9783446127487
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: Gut. 339 Seiten: graph. Darst. Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung altersentsprechend sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 400.
-
-
-
-
Python Data Structures and Algorithms: Improve application performance with graphs, stacks, and queues
Language: English
Published by Packt Publishing 2017-05-30, 2017
ISBN 10: 1786467356 ISBN 13: 9781786467355
Paperback. Condition: New.
-
Condition: As New. Unread book in perfect condition.
-
Graphs, data structures, algorithms
Seller: Celler Versandantiquariat, Eicklingen, Germany
Association Member: GIAQ
Seller rating 5 out of 5 stars
Hanser,München, 1979. 339 S. mit einigen Abb., kart. (ganzseitige Widmung auf Vorsatz)---- Berichte zur praktischen Informatik, Band 13 / Proceedings of the Workshop WG 78 on Graphtheoret. Concepts in Computer Science (4. Fachtagung über Graphentheoret. Konzepte in der Informatik), June 15 - 17, near Erlangen, Germany / Text englisch - 434 Gramm.
-
Condition: New. 1st ed. 2018 edition LISHERS AND DISTRIBUTORS PVT. LTD NO-PA16APR2015-KAP.
-
Cohesive Subgraph Computation over Large Sparse Graphs : Algorithms, Data Structures, and Programming Techniques
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Cohesive Subgraph Computation over Large Sparse Graphs : Algorithms, Data Structures, and Programming Techniques
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Cohesive Subgraph Computation over Large Sparse Graphs: Algorithms, Data Structures, and Programming Techniques
Language: English
Published by Springer-Verlag New York Inc, 2019
ISBN 10: 3030035980 ISBN 13: 9783030035983
Hardcover. Condition: Brand New. 107 pages. 9.50x6.50x0.25 inches. In Stock.
-
Cohesive Subgraph Computation over Large Sparse Graphs : Algorithms, Data Structures, and Programming Techniques
Language: English
Published by Springer International Publishing, 2019
ISBN 10: 3030035980 ISBN 13: 9783030035983
Buch. Condition: 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.
-
Graphs, Data Structures, Algorithms - Proceedings of the Workshop WG 78 5th Conference on Graphtheoretic Concepts in Computer Science (4. Fachtagung über Graphentheoretische Konzepte in der Informatik) June 15-17, 1979, Erlangen
Published by Hanser 1979, 1979
Seller: Andere Welten Medienvertriebs GmbH, Ahrensburg, SH, Germany
Seller rating 3 out of 5 stars
Softcover Sehr gut erhalten.
-
ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Language: English
Published by LAP LAMBERT Academic Publishing, 2010
ISBN 10: 383836838X ISBN 13: 9783838368382
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: New. Print on Demand pp. 310.
-
-
Condition: New. PRINT ON DEMAND.
-
ANTIPOLE TREE INDEXING AND GRAPHGREPVF : DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Language: English
Published by LAP LAMBERT Academic Publishing, 2010
ISBN 10: 383836838X ISBN 13: 9783838368382
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.
-
Cohesive Subgraph Computation over Large Sparse Graphs | Algorithms, Data Structures, and Programming Techniques
Language: English
Published by Springer International Publishing, 2019
ISBN 10: 3030035980 ISBN 13: 9783030035983
Buch. Condition: Neu. Cohesive Subgraph Computation over Large Sparse Graphs | Algorithms, Data Structures, and Programming Techniques | Lu Qin (u. a.) | Buch | xii | Englisch | 2019 | Springer International Publishing | EAN 9783030035983 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
-
Taschenbuch. Condition: Neu. Python Data Structures and Algorithms | Improve application performance with graphs, stacks, and queues | Benjamin Baka | Taschenbuch | Englisch | 2017 | Packt Publishing | EAN 9781786467355 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
-
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Implement classic and functional data structures and algorithms using Python Key Features A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures. Get a better understanding of advanced Python concepts such as big-o notation, dynamic programming, and functional data structures. Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner. Book Description Data structures allow you to organize data in a particular way efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. In this book, you will learn the essential Python data structures and the most common algorithms. With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. You will be able to create complex data structures such as graphs, stacks and queues. We will explore the application of binary searches and binary search trees. You will learn the common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. We will also discuss how to organize your code in a manageable, consistent, and extendable way. The book will explore in detail sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort. By the end of the book, you will learn how to build components that are easy to understand, debug, and use in different applications. What you will learn Gain a solid understanding of Python data structures. Build sophisticated data applications. Understand the common programming patterns and algorithms used in Python data science. Write efficient robust code.
