Beyond Shortest Paths: Node Fairness in Route Recommendation

Συγγραφείς: Ferrara, Antonio, García Soriano, David, Bonchi, Francesco

Πηγή: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Θεματικοί όροι: Àrees temàtiques de la UPC::Informàtica::Aplicacions de la informàtica, Graph algorithms analysis, Dynamic graph algorithms, Paths and connectivity problems, Shortest paths, Graph algorithms

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hdl.handle.net/2117/441585
https://doi.org/10.14778/3746405.3746440

Dual-GRU-GNN for Dynamic Blockchain Network Sharding

Συγγραφείς: Ye, Xianghe, Di, Qingxu, Du, Xinyuan, Bao, Ayong, Xing, Shusong

Πηγή: 2024 9th International Conference on Big Data Analytics (ICBDA) Big Data Analytics (ICBDA), 2024 9th International Conference on. :26-33 Mar, 2024

Relation: 2024 9th International Conference on Big Data Analytics (ICBDA)

An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time

Συγγραφείς: Raikwar, Hemraj, Karmakar, Sushanta

Πηγή: 2023 Eleventh International Symposium on Computing and Networking (CANDAR) CANDAR Computing and Networking (CANDAR), 2023 Eleventh International Symposium on. :168-174 Nov, 2023

Relation: 2023 Eleventh International Symposium on Computing and Networking (CANDAR)

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications

Συγγραφείς: Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg

Πηγή: STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing

Θεματικοί όροι: FOS: Computer and information sciences, Shortest-Paths, Dynamic Graph Algorithms, All-Pair Shortest-Paths, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.06402
http://hdl.handle.net/20.500.11850/680544

Faster Dynamic $(Δ+1)$-Coloring Against Adaptive Adversaries

Συγγραφείς: Flin, Maxime, Halldórsson, Magnús M.

Συνεισφορές: Maxime Flin and Magnús M. Halldórsson

Θεματικοί όροι: FOS: Computer and information sciences, Data Structures and Algorithms, Coloring, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.19729
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.79

Minimizing Recourse in an Adaptive Balls and Bins Game

Συγγραφείς: Fine, Adi, Kaplan, Haim, Stemmer, Uri

Συνεισφορές: Adi Fine and Haim Kaplan and Uri Stemmer

Θεματικοί όροι: Adaptive adversary, load-balancing game, dynamic 3-spanner, randomized algorithms, dynamic graph algorithms, balls-and-bins, adversarial robustness, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.77

Incremental Approximate Single-Source Shortest Paths with Predictions

Συγγραφείς: McCauley, Samuel, Moseley, Benjamin, Niaparast, Aidin, Niaparast, Helia, Singh, Shikha

Συνεισφορές: Samuel McCauley and Benjamin Moseley and Aidin Niaparast and Helia Niaparast and Shikha Singh

Θεματικοί όροι: Algorithms with Predictions, FOS: Computer and information sciences, Computer Science - Machine Learning, Shortest Paths, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004, Approximation Algorithms, Machine Learning (cs.LG)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.08125
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.117

Meerkat: A Framework for Dynamic Graph Algorithms on GPUs

Συγγραφείς: Concessao, Kevin Jude^{Aff1, IDs1076602400774z_cor1}, Cheramangalath, Unnikrishnan, Dev, Ricky, Nasre, Rupesh

Πηγή: International Journal of Parallel Programming. 52(5-6):400-453

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers

Συγγραφείς: Chen, Li, Goranci, Gramoz, Henzinger, Monika, Peng, Richard, Saranurak, Thatchaphol

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :1135-1146 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

Bootstrapping Dynamic APSP via Sparsification

Συγγραφείς: Kyng, Rasmus, Meierhans, Simon, Zöcklein, Gernot

Συνεισφορές: Benoit, Anne, Kaplan, Haim, Wild, Sebastian, Herman, Grzegorz

Πηγή: Leibniz International Proceedings in Informatics (LIPIcs), 351 (113:1) ; 33rd Annual European Symposium on Algorithms (ESA 2025)

Θεματικοί όροι: Dynamic graph algorithms, Spanners, Vertex sparsification, Bootstrapping

Περιγραφή αρχείου: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; info:eu-repo/grantAgreement/SNF/Projekte MINT/204787; info:eu-repo/grantAgreement/SNF/SNSF Starting Grants/218022; https://hdl.handle.net/20.500.11850/786365

Διαθεσιμότητα: https://hdl.handle.net/20.500.11850/786365
https://doi.org/10.3929/ethz-c-000786365

A Simple Dynamic Spanner via APSP

Συγγραφείς: Kyng, Rasmus, Meierhans, Simon, Zöcklein, Gernot

Συνεισφορές: Rasmus Kyng and Simon Meierhans and Gernot Zöcklein

Θεματικοί όροι: Dynamic graph algorithms, Spanner, Dynamic Greedy Spanner

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.111

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.ICALP.2025.111
https://nbn-resolving.org/urn:nbn:de:0030-drops-234886
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.111

Single-source shortest paths and strong connectivity in dynamic planar graphs

Συγγραφείς: Adam Karczmarz, Panagiotis Charalampopoulos

Συνεισφορές: Panagiotis Charalampopoulos and Adam Karczmarz, Fabrizio Grandoni, Grzegorz Herman, Peter Sanders

Πηγή: 28th Annual European Symposium on Algorithms (ESA 2020)

Θεματικοί όροι: Theory of computation → Dynamic graph algorithms, Theory of computation → Shortest paths, single-source shortest paths, 4. Education, dynamic graph algorithms, strong connectivity, 0102 computer and information sciences, ddc:004, 01 natural sciences, 7. Clean energy, planar graphs

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2020/12897/pdf/LIPIcs-ESA-2020-31.pdf
https://drops.dagstuhl.de/opus/volltexte/2020/12897/pdf/LIPIcs-ESA-2020-31.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12897/
https://dblp.uni-trier.de/db/conf/esa/esa2020.html#Charalampopoulos20
https://www.sciencedirect.com/science/article/pii/S002200002100091X
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.31

Near-Optimal Approximate Decremental All Pairs Shortest Paths

Συγγραφείς: Chechik, Shiri

Πηγή: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2018 IEEE 59th Annual Symposium on. :170-181 Oct, 2018

Relation: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)

Heuristic Based Ex-FTCD Algorithm for Incremental Path Finding in Dynamic Graphs

Συγγραφείς: Krishna, Athul, Moorthy, Adithya K, Gayathri, R G

Πηγή: 2018 International Conference on Data Science and Engineering (ICDSE) Data Science and Engineering (ICDSE), 2018 International Conference on. :1-6 Aug, 2018

Relation: 2018 International Conference on Data Science and Engineering (ICDSE)

Recent Advances in Efficient Dynamic Graph Processing

Συγγραφείς: Zi Chen, Keke Liang, Long Yuan, Wenjie Zhang, Zhengyi Yang

Πηγή: Applied Sciences, Vol 15, Iss 11, p 6003 (2025)

Θεματικοί όροι: graph analysis, dynamic graph algorithms, fully graph update, system, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999

Περιγραφή αρχείου: electronic resource

Relation: https://www.mdpi.com/2076-3417/15/11/6003; https://doaj.org/toc/2076-3417

Σύνδεσμος πρόσβασης: https://doaj.org/article/e8ed5d5564b049ffaa676eeafd9a870c

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Συγγραφείς: Nanongkai, Danupon, Saranurak, Thatchaphol, Wulff-Nilsen, Christian

Πηγή: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on. :950-961 Oct, 2017

Relation: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)

DH-Falcon: A Language for Large-Scale Graph Processing on Distributed Heterogeneous Systems

Συγγραφείς: Cheramangalath, Unnikrishnan, Nasre, Rupesh, Srikant, Y. N.

Πηγή: 2017 IEEE International Conference on Cluster Computing (CLUSTER) CLUSTER Cluster Computing (CLUSTER), 2017 IEEE International Conference on. :439-450 Sep, 2017

Relation: 2017 IEEE International Conference on Cluster Computing (CLUSTER)

A Simple Dynamic Spanner via APSP

Συγγραφείς: Kyng, Rasmus, Meierhans, Simon, Zöcklein, Gernot

Συνεισφορές: Rasmus Kyng and Simon Meierhans and Gernot Zöcklein

Θεματικοί όροι: FOS: Computer and information sciences, Dynamic Greedy Spanner, Dynamic graph algorithms, Computer Science - Data Structures and Algorithms, Spanner, Data Structures and Algorithms (cs.DS), ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2408.11368
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.111

Bootstrapping Dynamic APSP via Sparsification

Συγγραφείς: Kyng, Rasmus, Meierhans, Simon, Zöcklein, Gernot

Συνεισφορές: Rasmus Kyng and Simon Meierhans and Gernot Zöcklein

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Bootstrapping, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004, Vertex Sparsification, Spanners

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2408.11375
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.113

Constant-time Dynamic (Δ +1)-Coloring

Συγγραφείς: Henzinger, Monika, Peng, Pan

Συνεισφορές: Monika Henzinger and Pan Peng

Πηγή: ACM Transactions on Algorithms. 18:1-21

Θεματικοί όροι: Dynamic graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Random sampling, 01 natural sciences, Graph coloring

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.53