Search Results - graph algorithms in informatik

Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide: A Quick Reference Guide

Authors: Kathrin Hanauer Monika Henzinger Christian Schulz

Source: ACM Journal of Experimental Algorithmics. 27:1-45

Subject Terms: graph algorithms, 102031 Theoretische Informatik, 102031 Theoretical computer science, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences, Dynamic algorithms

Access URL: https://ucrisportal.univie.ac.at/de/publications/4ab0b08a-afa1-4e81-8174-4b7df66d91f9
https://doi.org/10.1145/3555806

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Authors: Henzinger, Monika Saha, Barna Seybold, Martin P. et al.

Contributors: Henzinger, Monika Saha, Barna Seybold, Martin P. et al.

Subject Terms: 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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2307.16771
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.62

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Authors: Hanauer, Kathrin Henzinger, Monika Schulz, Christian et al.

Contributors: Hanauer, Kathrin Henzinger, Monika Schulz, Christian et al.

Subject Terms: 102031 Theoretische Informatik, Mathematics of computing → Graph algorithms, 102031 Theoretical computer science, Networks → Network dynamics, survey, ddc:004, General and reference → Surveys and overviews, fully dynamic graph algorithms

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.1

O’Reach: Even Faster Reachability in Large Graphs: Even faster reachability in large graphs

Authors: Hanauer, Kathrin Schulz, Christian Trummer, Jonathan et al.

Contributors: Hanauer, Kathrin Schulz, Christian Trummer, Jonathan et al.

Source: ACM Journal of Experimental Algorithmics. 27:1-27

Subject Terms: graph algorithms, FOS: Computer and information sciences, Static graphs, static graphs, Algorithm Engineering, Graph Algorithms, Reachability, 02 engineering and technology, 102031 Theoretische Informatik, Reachability Index, reachability index, 102031 Theoretical computer science, Reachability index, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, algorithm engineering, Graph algorithms, Algorithm engineering, Static Graphs

File Description: application/pdf

Access URL: http://arxiv.org/abs/2008.10932
https://ucrisportal.univie.ac.at/de/publications/35e68b82-0d6a-4a15-ba84-656ff55b64a9
https://doi.org/10.1145/3556540
https://phaidra.univie.ac.at/o:2085875
https://hdl.handle.net/11353/10.2085875
https://doi.org/10.1145/3556540
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.13

Negative-Weight Single-Source Shortest Paths in Near-linear Time.

Authors: Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian

Source: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Subject Terms: GRAPH algorithms, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Differentially Private Algorithms for Graphs Under Continual Observation

Authors: Fichtenberger, Hendrik Henzinger, Monika Ost, Lara et al.

Contributors: Fichtenberger, Hendrik Henzinger, Monika Ost, Lara et al.

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Dynamic graph algorithms, Cryptography and Security, 4. Education, 02 engineering and technology, 102031 Theoretische Informatik, Differential privacy, differential privacy, continual observation, dynamic graph algorithms, 102031 Theoretical computer science, Continual observation, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, Cryptography and Security (cs.CR)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2106.14756
https://ucrisportal.univie.ac.at/de/publications/03f7ac53-3fc2-4531-b2ea-45b9e8e8ab5a
https://doi.org/10.4230/LIPIcs.ESA.2021.42
https://arxiv.org/pdf/2106.14756
https://dblp.uni-trier.de/db/journals/corr/corr2106.html#abs-2106-14756
https://drops.dagstuhl.de/opus/volltexte/2021/14623/
https://arxiv.org/abs/2106.14756
https://drops.dagstuhl.de/opus/volltexte/2021/14623/pdf/LIPIcs-ESA-2021-42.pdf/
https://doi.org/10.4230/LIPIcs.ESA.2021.42
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.42

On the Complexity of Weight-Dynamic Network Algorithms

Authors: Stefan Schmid Ami Paz Monika Henzinger

Source: 2021 IFIP Networking Conference (IFIP Networking). :1-9

Subject Terms: Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, 102031 Theoretische Informatik, PAIRS SHORTEST PATHS, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, GRAPHS

Access URL: http://arxiv.org/pdf/2105.13172
http://arxiv.org/abs/2105.13172
https://ucrisportal.univie.ac.at/de/publications/0c7c0dbe-0ff6-4fdf-b719-b74fd89f4e88
https://doi.org/10.23919/IFIPNetworking52078.2021.9472803
https://opendl.ifip-tc6.org/db/conf/networking/networking2021/1570699444.pdf
https://arxiv.org/abs/2105.13172
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-13172
https://arxiv.org/pdf/2105.13172
https://ieeexplore.ieee.org/document/9472803/

The topology of local computing in networks

Authors: Fraigniaud, Pierre Paz, Ami Pierre Fraigniaud and Ami Paz

Contributors: Fraigniaud, Pierre Paz, Ami Pierre Fraigniaud and Ami Paz

Source: Journal of Applied and Computational Topology. 8:1069-1098

Subject Terms: combinatorial topology, FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing, [INFO] Computer Science [cs], 01 natural sciences, 7. Clean energy, Distributed computing, 102031 Theoretische Informatik, Computer Science - Distributed, Parallel, and Cluster Computing, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing distributed graph algorithms combinatorial topology, distributed graph algorithms, 102031 Theoretical computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2003.03255
https://ucrisportal.univie.ac.at/de/publications/8b94d914-dcb8-4035-a20f-89f5b9cfd352
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://doi.org/10.4230/LIPIcs.ICALP.2020.128
https://arxiv.org/pdf/2003.03255
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://drops.dagstuhl.de/opus/volltexte/2020/12535/pdf/LIPIcs-ICALP-2020-128.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12535/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.128

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

Authors: Danupon Nanongkai Sebastian Krinninger Monika Henzinger

Source: Proceedings of the forty-sixth annual ACM symposium on Theory of computing. :674-683

Subject Terms: FOS: Computer and information sciences, 102031 Theoretische Informatik, Dynamic graph algorithms, 102031 Theoretical computer science, Shortest paths, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Reachability, 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/pdf/1504.07959
http://arxiv.org/abs/1504.07959
https://arxiv.org/pdf/1504.07959
https://arxiv.org/abs/1504.07959
https://dblp.uni-trier.de/db/conf/stoc/stoc2014.html#HenzingerKN14
https://dl.acm.org/doi/pdf/10.1145/2591796.2591869
https://ui.adsabs.harvard.edu/abs/2015arXiv150407959H/abstract
https://arxiv.org/abs/1504.07959
http://export.arxiv.org/pdf/1504.07959
https://128.84.21.199/abs/1504.07959?context=cs
https://arxiv.org/pdf/1504.07959.pdf

Flow-augmentation I: Directed graphs.

Authors: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Source: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-38, 38p

Subject Terms: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Algorithms and Hardness for Diameter in Dynamic Graphs

Authors: Ancona, Bertie Henzinger, Monika Roditty, Liam et al.

Contributors: Ancona, Bertie Henzinger, Monika Roditty, Liam et al.

Subject Terms: graph algorithms, FOS: Computer and information sciences, dynamic algorithms, Fine-grained complexity, 0102 computer and information sciences, 01 natural sciences, 102031 Theoretische Informatik, fine-grained complexity, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Graph algorithms, Dynamic algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/1811.12527
https://ucrisportal.univie.ac.at/de/publications/4bc9c01d-096e-45d1-9e84-36efef11d04d
https://doi.org/10.4230/LIPIcs.ICALP.2019.13
https://paperity.org/p/199630040/algorithms-and-hardness-for-diameter-in-dynamic-graphs
https://drops.dagstuhl.de/opus/volltexte/2019/10589/
https://drops.dagstuhl.de/opus/volltexte/2019/10589/pdf/LIPIcs-ICALP-2019-13.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-12527
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.13

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.

Authors: Bhattacharya, Sayan Kiss, Peter Saranurak, Thatchaphol et al.

Source: Journal of the ACM; Oct2024, Vol. 71 Issue 5, p1-32, 32p

Subject Terms: GRAPH algorithms, OPEN-ended questions, ALGORITHMS

Scalable graph algorithms in Rust (and Python)

Authors: Martin Junghanns Paul Horn Kompetenzzentrum für nicht-textuelle Materialien

Contributors: Martin Junghanns Paul Horn Kompetenzzentrum für nicht-textuelle Materialien

Subject Terms: Computer Science, Studienbereich Informatik, Ingenieurwissenschaften

Relation: https://av.tib.eu/media/61641

Availability: https://av.tib.eu/media/61641

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms

Authors: Goranci, Gramoz Henzinger, Monika Peng, Pan et al.

Contributors: Goranci, Gramoz Henzinger, Monika Peng, Pan et al.

Subject Terms: FOS: Computer and information sciences, Electrical flow, Dynamic graph algorithms, 4. Education, 0102 computer and information sciences, 01 natural sciences, 7. Clean energy, electrical flow, 102031 Theoretische Informatik, Minor-free graphs, Max flow, max flow, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, minor-free graphs

File Description: application/pdf

Access URL: http://arxiv.org/abs/1712.06473
https://ucrisportal.univie.ac.at/de/publications/2748b255-46c0-4bad-bcc6-c1fc36076097
https://doi.org/10.4230/LIPIcs.ESA.2017.45
https://drops.dagstuhl.de/opus/volltexte/2017/7846/
https://arxiv.org/abs/1712.06473
https://dblp.uni-trier.de/db/journals/corr/corr1712.html#abs-1712-06473
https://eprints.whiterose.ac.uk/147337/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.45

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number: Recognition algorithms for orders of small width and graphs of small Dilworth number

Authors: Felsner, Stefan Raghavan, Vijay Spinrad, Jeremy P.

Source: Order. 20:351-364

Subject Terms: 4. Education, 0102 computer and information sciences, 02 engineering and technology, recognition algorithms, 16. Peace & justice, 7. Clean energy, 01 natural sciences, Combinatorics of partially ordered sets, width, Graph algorithms (graph-theoretic aspects), partial order, 0202 electrical engineering, electronic engineering, information engineering, Structural characterization of families of graphs, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, Dilworth number

File Description: application/xml

Access URL: https://refubium.fu-berlin.de/bitstream/fub188/18407/1/tr-b-99-05.pdf
https://zbmath.org/2153979
https://doi.org/10.1023/b:orde.0000034609.99940.fb
https://dblp.uni-trier.de/db/journals/order/order20.html#FelsnerRS03
http://www.diss.fu-berlin.de/docs/receive/FUDOCS_document_000000001573
https://link.springer.com/content/pdf/10.1023/B:ORDE.0000034609.99940.fb.pdf
https://refubium.fu-berlin.de/handle/fub188/18407
https://link.springer.com/article/10.1023/B:ORDE.0000034609.99940.fb
https://refubium.fu-berlin.de/handle/fub188/18407

Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism ; LIPIcs

Authors: Dhulipala, Laxman Henzinger, Monika H Li, George Z. et al.

Source: Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In: 33rd Annual European Symposium on Algorithms . Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi: 10.4230/LIPIcs.ESA.2025.91

Subject Terms: ddc:000

Relation: info:eu-repo/semantics/altIdentifier/issn/1868-8969; info:eu-repo/semantics/altIdentifier/isbn/9783959773959; info:eu-repo/semantics/altIdentifier/arxiv/2508.02182

Availability: https://research-explorer.ista.ac.at/record/20535
https://research-explorer.ista.ac.at/download/20535/20539

Trapezoid graphs and generalizations, geometry and algorithms

Authors: Lorenz Wernisch Rudolf Müller Stefan Felsner

Source: Lecture Notes in Computer Science ISBN: 9783540582182

Subject Terms: circle trapezoid graphs, Order dimension, Applied Mathematics, Graph representations (geometric and intersection representations, etc.), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics of partially ordered sets, Trapezoid graphs, chromatic number, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Computer graphics, computational geometry (digital and algorithmic aspects), trapezoid graphs, Discrete Mathematics and Combinatorics, Analysis of algorithms, Structural characterization of families of graphs, Partially ordered sets, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, Algorithms

File Description: application/xml

Access URL: https://refubium.fu-berlin.de/bitstream/fub188/18132/1/1994_02.pdf
https://dblp.uni-trier.de/db/conf/swat/swat94.html#FelsnerMW94
https://link.springer.com/10.1007/3-540-58218-5_13
https://link.springer.com/chapter/10.1007%2F3-540-58218-5_13
http://core.ac.uk/display/24241883
https://rd.springer.com/chapter/10.1007/3-540-58218-5_13
https://dblp.uni-trier.de/db/journals/dam/dam74.html#FelsnerMW97
https://www.sciencedirect.com/science/article/abs/pii/S0166218X96000133
https://www.sciencedirect.com/science/article/pii/S0166218X96000133
https://link.springer.com/chapter/10.1007/3-540-58218-5_13
https://refubium.fu-berlin.de/handle/fub188/18132

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

Authors: Henzinger, Monika Paz, Ami Sricharan, A. R. et al.

Contributors: Henzinger, Monika Paz, Ami Sricharan, A. R. et al.

Subject Terms: Theory of computation → Dynamic graph algorithms, FOS: Computer and information sciences, 102031 Theoretische Informatik, Expander graphs, Dynamic graph algorithms, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Power-law graphs, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2208.07572
https://ucrisportal.univie.ac.at/de/publications/f57e8767-b615-45f7-91f6-020bba392f0c
https://doi.org/10.4230/LIPIcs.ESA.2022.65
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.65

Average-Case Analysis of Dynamic Graph Algorithms: Average-case analysis of dynamic graph algorithms

Authors: Alberts, David Rauch-Henzinger, Monika

Source: Algorithmica. 20:31-60

Subject Terms: Connectivity, Bipartiteness, Average case analysis, 0102 computer and information sciences, 01 natural sciences, Graph theory (including graph drawing) in computer science, dynamic graph algorithms, maximum cardinality matching, Matching, minimum spanning forest, Parallel algorithms in computer science, 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, Dynamic algorithms

File Description: application/xml

Access URL: https://infoscience.epfl.ch/record/99345/files/AlbertsH98.pdf
https://zbmath.org/1154500
https://doi.org/10.1007/pl00009186
https://link.springer.com/article/10.1007/PL00009186
https://infoscience.epfl.ch/record/99345
https://link.springer.com/10.1007/PL00009186
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica20.html#AlbertsH98
https://dl.acm.org/doi/10.5555/313651.313712
https://dblp.uni-trier.de/db/conf/soda/soda95.html#AlbertsH95
https://infoscience.epfl.ch/record/99345/files/AlbertsH98.pdf
https://link.springer.com/article/10.1007%2FPL00009186
https://refubium.fu-berlin.de/handle/fub188/18231

Pre-Processing Structured Data for Standard Machine Learning Algorithms by Supervised Graph Propositionalization - a Case Study with Medicinal Chemistry Datasets

Authors: Karunaratne, Thashmee Boström, Henrik Norinder, Ulf

Source: Ninth International Conference on Machine Learning and Applications (ICMLA), 2010. :828-833

Subject Terms: SOCIAL SCIENCES, Statistics, computer and systems science, Informatics, Computer and systems science, SAMHÄLLSVETENSKAP, Statistik, data- och systemvetenskap, Informatik, Data- och systemvetenskap, Computer and Systems Sciences

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-221570
https://kth.diva-portal.org/smash/get/diva2:1175238/FULLTEXT01.pdf