Výsledky vyhledávání - "Dynamic Graph Algorithms"

Beyond Shortest Paths: Node Fairness in Route Recommendation

Autoři: Ferrara, Antonio García Soriano, David Bonchi, Francesco

Zdroj: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Témata: À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

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/2117/441585
https://doi.org/10.14778/3746405.3746440

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

Autoři: Rasmus Kyng Simon Meierhans Maximilian Probst Gutenberg

Zdroj: STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing

Témata: 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

Přístupová URL adresa: http://arxiv.org/abs/2311.06402
http://hdl.handle.net/20.500.11850/680544

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

Autoři: Flin, Maxime Halldórsson, Magnús M. Maxime Flin and Magnús M. Halldórsson

Přispěvatelé: Flin, Maxime Halldórsson, Magnús M. Maxime Flin and Magnús M. Halldórsson

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Coloring, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: Fine, Adi Kaplan, Haim Stemmer, Uri a další

Přispěvatelé: Fine, Adi Kaplan, Haim Stemmer, Uri a další

Témata: Adaptive adversary, load-balancing game, dynamic 3-spanner, randomized algorithms, dynamic graph algorithms, balls-and-bins, adversarial robustness, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.77

Incremental Approximate Single-Source Shortest Paths with Predictions

Autoři: McCauley, Samuel Moseley, Benjamin Niaparast, Aidin a další

Přispěvatelé: McCauley, Samuel Moseley, Benjamin Niaparast, Aidin a další

Témata: 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)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2502.08125
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.117

Bootstrapping Dynamic APSP via Sparsification

Autoři: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Přispěvatelé: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

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

Témata: Dynamic graph algorithms, Spanners, Vertex sparsification, Bootstrapping

Popis souboru: 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

Dostupnost: https://hdl.handle.net/20.500.11850/786365
https://doi.org/10.3929/ethz-c-000786365

A Simple Dynamic Spanner via APSP

Autoři: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Přispěvatelé: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Témata: Dynamic graph algorithms, Spanner, Dynamic Greedy Spanner

Popis souboru: 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

Dostupnost: 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

Autoři: Adam Karczmarz Panagiotis Charalampopoulos Panagiotis Charalampopoulos and Adam Karczmarz a další

Přispěvatelé: Adam Karczmarz Panagiotis Charalampopoulos Panagiotis Charalampopoulos and Adam Karczmarz a další

Zdroj: 28th Annual European Symposium on Algorithms (ESA 2020)

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: 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

Recent Advances in Efficient Dynamic Graph Processing

Autoři: Zi Chen Keke Liang Long Yuan a další

Zdroj: Applied Sciences, Vol 15, Iss 11, p 6003 (2025)

Témata: 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

Popis souboru: electronic resource

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

Přístupová URL adresa: https://doaj.org/article/e8ed5d5564b049ffaa676eeafd9a870c

A Simple Dynamic Spanner via APSP

Autoři: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Přispěvatelé: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2408.11368
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.111

Bootstrapping Dynamic APSP via Sparsification

Autoři: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Přispěvatelé: Kyng, Rasmus Meierhans, Simon Zöcklein, Gernot a další

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2408.11375
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.113

Constant-time Dynamic (Δ +1)-Coloring

Autoři: Henzinger, Monika Peng, Pan Monika Henzinger and Pan Peng

Přispěvatelé: Henzinger, Monika Peng, Pan Monika Henzinger and Pan Peng

Zdroj: ACM Transactions on Algorithms. 18:1-21

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.53

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Autoři: Henzinger, Monika Saha, Barna Seybold, Martin P. a další

Přispěvatelé: Henzinger, Monika Saha, Barna Seybold, Martin P. a další

Témata: Dynamic Graph Algorithms, Algorithms with Predictions

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.62

Dostupnost: https://doi.org/10.4230/LIPIcs.ITCS.2024.62
https://nbn-resolving.org/urn:nbn:de:0030-drops-195907
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.62

Self-Stabilizing Clock Synchronization in Probabilistic Networks

Autoři: Charron-Bost, Bernadette Penet de Monterno, Louis CHARRON-BOST, Bernadette a další

Přispěvatelé: Charron-Bost, Bernadette Penet de Monterno, Louis CHARRON-BOST, Bernadette a další

Témata: Theory of computation → Dynamic graph algorithms, Probabilistic networks, Clock synchronization, Theory of computation → Dynamic graph algorithms phrases Self-stabilization Clock synchronization Probabilistic networks, 2012 ACM Subject Classification Theory of computation → Distributed algorithms, ddc:004, Theory of computation → Distributed algorithms, [INFO] Computer Science [cs], Self-stabilization, Theory of computation → Dynamic graph algorithms phrases Self-stabilization

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.12

Improved Dynamic Graph Coloring

Autoři: Solomon, Shay Wein, Nicole Shay Solomon and Nicole Wein

Přispěvatelé: Solomon, Shay Wein, Nicole Shay Solomon and Nicole Wein

Zdroj: ACM Transactions on Algorithms. 16:1-24

Témata: FOS: Computer and information sciences, dynamic graph algorithms, Computer Science - Data Structures and Algorithms, graph arboricity, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, coloring, edge orientations

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9535/pdf/LIPIcs-ESA-2018-72.pdf
http://arxiv.org/abs/1904.12427
https://dblp.uni-trier.de/db/conf/esa/esa2018.html#SolomonW18
https://drops.dagstuhl.de/opus/volltexte/2018/9535/
https://drops.dagstuhl.de/opus/volltexte/2018/9535/pdf/LIPIcs-ESA-2018-72.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.72

Fully Dynamic MIS in Uniformly Sparse Graphs

Autoři: Onak, Krzysztof Schieber, Baruch Solomon, Shay a další

Přispěvatelé: Onak, Krzysztof Schieber, Baruch Solomon, Shay a další

Zdroj: ACM Transactions on Algorithms. 16:1-19

Témata: FOS: Computer and information sciences, independent set, dynamic graph algorithms, Computer Science - Data Structures and Algorithms, graph arboricity, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences, sparse graphs

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9096/pdf/LIPIcs-ICALP-2018-92.pdf
http://arxiv.org/abs/1808.10316
https://researchwith.njit.edu/en/publications/fully-dynamic-mis-in-uniformly-sparse-graphs
https://dblp.uni-trier.de/db/conf/icalp/icalp2018.html#OnakSSW18
https://www.researchwithnj.com/en/publications/fully-dynamic-mis-in-uniformly-sparse-graphs-3
https://dblp.uni-trier.de/db/journals/corr/corr1808.html#abs-1808-10316
https://dl.acm.org/doi/10.1145/3378025
https://doi.org/10.1145/3378025
https://researchwith.njit.edu/en/publications/fully-dynamic-mis-in-uniformly-sparse-graphs-2
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.92

Dynamic Maintenance of Monotone Dynamic Programs and Applications

Autoři: Henzinger, Monika Neumann, Stefan Räcke, Harald a další

Přispěvatelé: Henzinger, Monika Neumann, Stefan Räcke, Harald a další

Témata: Theory of computation → Dynamic graph algorithms, FOS: Computer and information sciences, data structures, dynamic algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic programming, Theory of computation → Packing and covering problems

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2301.01744
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.36

Bootstrapping Dynamic Distance Oracles

Autoři: Forster, Sebastian Goranci, Gramoz Nazari, Yasamin a další

Přispěvatelé: Forster, Sebastian Goranci, Gramoz Nazari, Yasamin a další

Témata: FOS: Computer and information sciences, 102031 Theoretische Informatik, Dynamic graph algorithms, Shortest Paths, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Distance Oracles, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2303.06102
https://hdl.handle.net/1871.1/58db73a4-54e4-4912-ab5f-9eceb3753d41
https://doi.org/10.4230/LIPIcs.ESA.2023.50
https://research.vu.nl/en/publications/58db73a4-54e4-4912-ab5f-9eceb3753d41
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.50

Efficient Data Structures for Incremental Exact and Approximate Maximum Flow

Autoři: Goranci, Gramoz Henzinger, Monika Gramoz Goranci and Monika Henzinger

Přispěvatelé: Goranci, Gramoz Henzinger, Monika Gramoz Goranci and Monika Henzinger

Témata: 102031 Theoretische Informatik, data structures, 102031 Theoretical computer science, dynamic graph algorithms, ddc:004, maximum flow

Popis souboru: application/pdf

Přístupová URL adresa: https://ucrisportal.univie.ac.at/de/publications/1231ff8b-6ecf-437b-8e4c-3ca4c4819806
https://doi.org/10.4230/LIPIcs.ICALP.2023.69
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.69

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Autoři: Henzinger, Monika Saha, Barna Seybold, Martin P. a další

Přispěvatelé: Henzinger, Monika Saha, Barna Seybold, Martin P. a další

Témata: Algorithms with Predictions, FOS: Computer and information sciences, 102031 Theoretische Informatik, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2307.16771
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.62