Fast parallel algorithms for graph matching problems /
Spremljeno u:
| Glavni autor: | Karpinski, Marek, 1948- |
|---|---|
| Daljnji autori: | Rytter, Wojciech. |
| Format: | Sách giấy |
| Izdano: |
Oxford :
Clarendon Press,
1998.
|
| Serija: | Oxford lecture series in mathematics and its applications ;
9 Oxford science publications |
| Teme: | |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
Similar Items
-
Parallel algorithms for graph problems /
od: Metaxas, Panatiotis.
Izdano: (2000) -
Algorithmic graph theory
od: Alan Gibbons
Izdano: (1985) -
Graph matching-based distributed clustering and backbone formation algorithms for sensor networks /
od: Dagdeviren, Orhan. -
Using Dijkstra and Floyd Algorithms from Graph Theory to Solve Real-World Shortest Path Problems
od: Ho, Thi Hong Lien
Izdano: (2026) -
Applied and algorithmic graph theory
od: Gary Chartrand
Izdano: (1993)


