عنوان

Algebraic graph algorithms :

ويژگيها

(electronic bk.)

ويژگيها

(electronic bk.)

شابک

9783030878863

شابک

3030878864

شابک اشتباه

3030878856

شابک اشتباه

9783030878856

شماره ISMN

10.1007/978-3-030-87886-3

شماره

15163

شماره کنترل سيستم

(OCoLC)1287135608

شماره کنترل سيستم غير معتبر يا حذف شده

(OCoLC)1285871225

زبان متن نوشتاري يا گفتاري و مانند آن

انگلیسی

عنوان اصلي

Algebraic graph algorithms :

ساير اطلاعات عنواني

a practical guide using Python /

نام نخستين پديدآور

K. Erciyes.

محل نشرو پخش و غیره

Cham, Switzerland :

نام ناشر، پخش کننده و غيره

Springer,

تاریخ نشرو بخش و غیره

2021.

نام خاص و کميت اثر

221p.

عنوان فروست

Undergraduate topics in computer science.

متن يادداشت

Available to OhioLINK libraries.

متن يادداشت

Includes bibliographical references and index.

متن يادداشت

1. Introduction -- 2. Graphs, Matrices and Matroids -- 3. Parallel Matrix Algorithm Kernel -- 4. Basic Graph Algorithms -- 5. Connectivity, Matching and Matroids -- 6. Subgraph Search -- 7. Analysis of Large Graphs -- 8. Clustering in Complex Networks -- 9. Kronecker Graphs -- 10. Sample Algorithms for Complex Networks.

بدون عنوان

0

متن يادداشت

There has been unprecedented growth in the study of graphs, which are discrete structures that have many real-world applications. The design and analysis of algebraic algorithms to solve graph problems have many advantages, such as implementing results from matrix algebra and using the already available matrix code for sequential and parallel processing. Providing Python programming language code for nearly all algorithms, this accessible textbook focuses on practical algebraic graph algorithms using results from matrix algebra rather than algebraic study of graphs. Given the vast theory behind the algebraic nature of graphs, the book strives for an accessible, middle-ground approach by reviewing main algebraic results that are useful in designing practical graph algorithms on the one hand, yet mostly using graph matrices to solve the graph problems. Python is selected for its simplicity, efficiency and rich library routines; and with the code herein, brevity is forsaken for clarity. Topics and features: Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design Provides matroid-based solutions to some graph problems, including greedy algorithm problems Offers Python code that can be tested and modified for various inputs Supplies practical hints, where possible, for parallel processing associated with algebraic algorithms Links to a web page with supportive materials This clearly arranged textbook will be highly suitable for upper-level undergraduate students of computer science, electrical and electronic engineering, bioinformatics, and any researcher or person with background in discrete mathematics, basic graph theory and algorithms. Dr. Kayhan Erciyes is a full Professor in the Department of Software Engineering at Maltepe University, Istanbul, Turkey. His other publications include the Springer titles Discrete Mathematics and Graph Theory, Distributed Real-Time Systems, Guide to Graph Algorithms, Distributed and Sequential Algorithms for Bioinformatics, and Distributed Graph Algorithms for Computer Networks.

پديدآور

Erciyes, K.

محل نشر

Cham : Springer International Publishing AG,c2021

عنوان

Algebraic Graph Algorithms

شماره استاندارد بين المللي کتاب و موسيقي

9783030878856.

عنصر شناسه ای

Graph algorithms.

عنصر شناسه ای

Python (Computer program language)

کد مقوله موضوعی

COM051300

کد سيستم

bisacsh

شماره

ويراست

شماره رده

نشانه اثر

عنصر شناسه اي

Erciyes, K.,

عنصر شناسه اي

Ohio Library and Information Network.

سازمان

کتابخانه مرکزی و مرکز اطلاع رسانی دانشگاه

تاريخ عمليات

20231024040932.0

قواعد فهرست نويسي ( بخش توصيفي )

rda

تاريخ و ساعت مذاکره و دسترسي

A Practical Guide Using Python-Springer (2022).pdf

مشخصه منبع قراردادي

https://rave.ohiolink.edu/ebooks/ebc2/9783030878863

مشخصه منبع قراردادي

https://link.springer.com/10.1007/978-3-030-87886-3

مشخصه منبع قراردادي

http://proxy.ohiolink.edu:9099/login?url=https://link.springer.com/10.1007/978-3-030-87886-3

يادداشت عمومي

Connect to resource

يادداشت عمومي

Connect to resource

يادداشت عمومي

Connect to resource (off-campus)

نوع ماده

BL

کد کاربرگه

270410

تكميل شده

Y