Arama Sonuçları Graph algorithms. - Daraltılmış: 2019
SirsiDynix Enterprise
https://katalog.hacettepe.edu.tr/client/tr_TR/default_tr/default_tr/qu$003dGraph$002balgorithms.$0026qf$003dPUBDATE$002509Publication$002bDate$0025092019$0025092019$0026ic$003dtrue$0026ps$003d300?
2026-02-09T08:27:47Z
Algorithms and Models for the Web Graph 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6–7, 2019, Proceedings
ent://SD_ILS/0/SD_ILS:483676
2026-02-09T08:27:47Z
2026-02-09T08:27:47Z
Yazar Avrachenkov, Konstantin. editor. Prałat, Paweł. editor. Ye, Nan. editor. SpringerLink (Online service)<br/>Yer Numarası ONLINE<br/>Elektronik Erişim <a href="https://doi.org/10.1007/978-3-030-25070-6">https://doi.org/10.1007/978-3-030-25070-6</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Topographical tools for filtering and segmentation. 2, Flooding and marker-based segmentation on node- or edge-weighted graphs
ent://SD_ILS/0/SD_ILS:595054
2026-02-09T08:27:47Z
2026-02-09T08:27:47Z
Yazar Meyer, Fernand, 1952- author.<br/>Yer Numarası GA145<br/>Elektronik Erişim <a href="https://onlinelibrary.wiley.com/doi/book/10.1002/9781119575139">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119575139</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>
Topographical tools for filtering and segmentation. 1, Watersheds on node- or edge-weighted graphs
ent://SD_ILS/0/SD_ILS:595056
2026-02-09T08:27:47Z
2026-02-09T08:27:47Z
Yazar Meyer, Fernand, 1952- author.<br/>Yer Numarası GA145<br/>Elektronik Erişim <a href="https://onlinelibrary.wiley.com/doi/book/10.1002/9781119579519">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119579519</a><br/>Format: Elektrnik Kaynak<br/>Durum Çevrimiçi Kütüphane~1<br/>