Fast parallel algorithms for graph matching problems
By: Karpinski, Marek.
Contributor(s): Rytter, Wojciech.
Material type: BookSeries: Oxford Lecture Series In Mathematics And Its Applications / Edited By John Ball. Publisher: Oxford Clarendon Press 1998Description: xi, 212p.ISBN: 0 19 850162 5.Subject(s): Matching Theory | Graph Theory | Parallel AlgorithmsDDC classification: 511.5 | K148fItem type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | PK Kelkar Library, IIT Kanpur | General Stacks | 511.5 K148f (Browse shelf) | Available | A138704 |
Total holds: 0
Browsing PK Kelkar Library, IIT Kanpur Shelves , Collection code: General Stacks Close shelf browser
511.5 J453G GRAPH COLORING PROBLEMS | 511.5 J957G GRAPHS,NETWORKS AND ALGORITHMS | 511.5 J958G2 GRAPHS' NETWORKS AND ALGOROTHMS | 511.5 K148f Fast parallel algorithms for graph matching problems | 511.5 K754g GRAPHENTHEORETISCHE METHODEN UND IHRE ANWENDUNGEN | 511.5 K81G GRAPHS, ALGORITHMS, AND OPTIMIZATION | 511.5 K836tE THEORY OF FINITE & INFINITE GRAPHS |
V.9
There are no comments for this item.