Suchergebnisse - "Dynamic graph algorithms"
-
1
Autoren:
Quelle: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)Schlagwörter: À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
Dateibeschreibung: application/pdf
-
2
Autoren:
Quelle: STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Schlagwörter: 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
-
3
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Data Structures and Algorithms, Coloring, Data Structures and Algorithms (cs.DS), Dynamic Graph Algorithms, ddc:004
Dateibeschreibung: application/pdf
-
4
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Adaptive adversary, load-balancing game, dynamic 3-spanner, randomized algorithms, dynamic graph algorithms, balls-and-bins, adversarial robustness, ddc:004
Dateibeschreibung: application/pdf
-
5
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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)
Dateibeschreibung: application/pdf
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 351 (113:1) ; 33rd Annual European Symposium on Algorithms (ESA 2025)
Schlagwörter: Dynamic graph algorithms, Spanners, Vertex sparsification, Bootstrapping
Dateibeschreibung: 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
-
7
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Dynamic graph algorithms, Spanner, Dynamic Greedy Spanner
Dateibeschreibung: 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
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 28th Annual European Symposium on Algorithms (ESA 2020)
Schlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-URL: 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 -
9
Autoren: et al.
Quelle: Applied Sciences, Vol 15, Iss 11, p 6003 (2025)
Schlagwörter: 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
Dateibeschreibung: electronic resource
-
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
12
Autoren:
Weitere Verfasser:
Quelle: ACM Transactions on Algorithms. 18:1-21
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
13
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Dynamic Graph Algorithms, Algorithms with Predictions
Dateibeschreibung: 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
-
14
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
15
Autoren:
Weitere Verfasser:
Quelle: ACM Transactions on Algorithms. 16:1-24
Schlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-URL: 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 -
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Algorithms. 16:1-19
Schlagwörter: 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
Dateibeschreibung: application/pdf
Zugangs-URL: 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 -
17
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
18
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
-
19
Autoren:
Weitere Verfasser:
Schlagwörter: 102031 Theoretische Informatik, data structures, 102031 Theoretical computer science, dynamic graph algorithms, ddc:004, maximum flow
Dateibeschreibung: application/pdf
-
20
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: 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
Dateibeschreibung: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science