Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach

Karpinski

Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach - Oxford University PressOxford University Press 2023

ISBN: 9781383020106

Source: EBOOK

Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach

APA

Karpinski, . (2023). Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach. : Oxford University PressOxford University Press.

Chicago

Karpinski, . 2023. Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach. : Oxford University PressOxford University Press.

Harvard

Karpinski, . (2023). Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach. : Oxford University PressOxford University Press.

MLA

Karpinski, . Fast Parallel Algorithms for Graph Matching Problems Combinatorial, Algebraic, and Probabilistic Approach. : Oxford University PressOxford University Press. 2023.

Place hold
Print
Cite
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

Exporting to Dublin Core...

Simple DC-RDF

OAI-DC

SRW-DC