Výsledky vyhledávání - "((\"graph algorithms in informatik\") OR (\"graph algorithms in informatics\"))*"

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

Autoři: Bernstein, Aaron Nanongkai, Danupon Wulff-Nilsen, Christian

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

Témata: GRAPH algorithms, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Flow-augmentation I: Directed graphs.

Autoři: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin a další

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

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Approximation algorithms for network design in non-uniform fault models.

Autoři: Chekuri, Chandra Jain, Rhea

Zdroj: Mathematical Programming. Dec2025, p1-40.

Témata: *FAULT tolerance (Engineering), APPROXIMATION algorithms, GRAPH connectivity, COMPUTER network reliability

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

Autoři: Karunaratne, Thashmee Boström, Henrik Norinder, Ulf

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

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

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-221570
https://kth.diva-portal.org/smash/get/diva2:1175238/FULLTEXT01.pdf

Killing a Vortex.

Autoři: Thilikos, Dimitrios M. Wiederrecht, Sebastian

Zdroj: Journal of the ACM; Aug2024, Vol. 71 Issue 4, p1-56, 56p

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, GENERATING functions, MINORS, COUNTING, BIPARTITE graphs

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs.

Autoři: BODWIN, GREG PARTER, MERAV

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-24, 24p

Témata: DISTRIBUTED algorithms, WRENCHES, GRAPH algorithms, FAULT tolerance (Engineering), UNDIRECTED graphs

Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources.

Autoři: Alharbi, Hatoon Hur, Ali Alkahtani, Hasan a další

Zdroj: PeerJ Computer Science; Apr2025, p1-46, 46p

Témata: KNOWLEDGE graphs, DATA integration, ELECTRONIC data processing, GRAPH algorithms, NATURAL language processing, KNOWLEDGE representation (Information theory), CYBERTERRORISM, INTERNET security

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity.

Autoři: Akmal, Shyan Jin, Ce

Zdroj: Algorithmica. May2024, Vol. 86 Issue 5, p1623-1656. 34p.

Témata: *DIRECTED graphs, *DIRECTED acyclic graphs, *FLOWGRAPHS, *UNDIRECTED graphs, *TIME complexity, *RANDOM matrices

On String and Graph Sanitization

Autoři: Bernardini, Giulia Chen, Huiping Loukides, Grigorios a další

Přispěvatelé: Bernardini, Giulia Chen, Huiping Loukides, Grigorios a další

Zdroj: Bernardini, G, Chen, H, Loukides, G & Pissis, S P 2025, On String and Graph Sanitization. in A Conte, A Conte, A Marino, G Rosone, J S Vitter & J S Vitter (eds), From Strings to Graphs, and Back Again : A Festschrift for Roberto Grossi's 60th Birthday., 9, OpenAccess Series in Informatics, vol. 132, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-10, From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday 2025, Venice, Italy, 25/07/25. https://doi.org/10.4230/OASIcs.Grossi.9

Témata: data privacy, data sanitization, graph algorithms, string algorithms

Relation: urn:ISBN:9783959773911

Dostupnost: https://research.vu.nl/en/publications/9eb0c27e-ee74-44a9-945b-f01384060438
https://doi.org/10.4230/OASIcs.Grossi.9
https://hdl.handle.net/1871.1/9eb0c27e-ee74-44a9-945b-f01384060438
http://www.scopus.com/inward/record.url?scp=105013472015&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=105013472015&partnerID=8YFLogxK
https://drops.dagstuhl.de/entities/volume/OASIcs-volume-132

Beeping Deterministic CONGEST Algorithms in Graphs

Autoři: Garncarek, Pawel Kowalski, Dariusz R. Kutten, Shay a další

Přispěvatelé: Garncarek, Pawel Kowalski, Dariusz R. Kutten, Shay a další

Témata: Beeping Networks, CONGEST Networks, deterministic simulations, graph algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.20

Dostupnost: https://doi.org/10.4230/LIPIcs.ESA.2025.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-244880
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.20

Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk)

Autoři: Kyng, Rasmus Rasmus Kyng

Přispěvatelé: Kyng, Rasmus Rasmus Kyng

Témata: Graph algorithms and data strucures, continuous optimization, interior point methods

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 345, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.3

Dostupnost: https://doi.org/10.4230/LIPIcs.MFCS.2025.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-241109
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.3

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Autoři: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik a další

Zdroj: ISSN: 1868-8969.

Témata: Graph Partitioning, Graph Algorithms, Linear Time Algorithms, Graph Sparsification, Theory of computation → Design and analysis of algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000186957; https://publikationen.bibliothek.kit.edu/1000186957/169409927; https://doi.org/10.5445/IR/1000186957

Dostupnost: https://publikationen.bibliothek.kit.edu/1000186957
https://publikationen.bibliothek.kit.edu/1000186957/169409927
https://doi.org/10.5445/IR/1000186957

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs

Autoři: Künnemann, Marvin Redzic, Mirza

Zdroj: ISSN: 1868-8969.

Témata: Fine-grained complexity theory, Dominating set, Sparsity in graphs, Conditionally optimal algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Problems, reductions and completeness, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz international proceedings in informatics : LIPIcs / Schloss Dagstuhl Leibniz-Zentrum für Informatik; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-353-9; info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000179197; https://publikationen.bibliothek.kit.edu/1000179197/157077211; https://doi.org/10.5445/IR/1000179197

Dostupnost: https://publikationen.bibliothek.kit.edu/1000179197
https://publikationen.bibliothek.kit.edu/1000179197/157077211
https://doi.org/10.5445/IR/1000179197

Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041)

Autoři: Agrawal, Akanksha Chudnovsky, Maria Paulusma, Daniël a další

Přispěvatelé: Agrawal, Akanksha Chudnovsky, Maria Paulusma, Daniël a další

Témata: computational complexity, graph algorithms, graph classes, graph containment relations, graph width parameters

Popis souboru: application/pdf

Relation: Is Part Of Dagstuhl Reports, Volume 15, Issue 1 (2025); https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.1.105

Dostupnost: https://doi.org/10.4230/DagRep.15.1.105
https://nbn-resolving.org/urn:nbn:de:0030-drops-236749
https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.1.105

The Complexity of Homomorphism Reconstructibility

Autoři: Jan Böker Louis Härtel Nina Runde a další

Přispěvatelé: Jan Böker Louis Härtel Nina Runde a další

Zdroj: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Témata: FOS: Computer and information sciences, Mathematics of computing → Graph theory, Discrete Mathematics (cs.DM), Theory of computation → Graph algorithms analysis, graph homomorphism, parameterised complexity, Computer Science - Data Structures and Algorithms, counting complexity, FOS: Mathematics, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2310.09009
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.19
https://publications.rwth-aachen.de/record/981455

AVERAGE SENSITIVITY OF GRAPH ALGORITHMS.

Autoři: VARMA, NITHIN YUICHI YOSHIDA

Zdroj: SIAM Journal on Computing; 2023, Vol. 52 Issue 4, p1039-1081, 43p

Témata: HAMMING distance, APPROXIMATION algorithms, CUTTING stock problem, GRAPH algorithms, ALGORITHMS, OPEN-ended questions, RANDOM graphs

Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants.

Autoři: Qiu, Yutong Shen, Yihang Kingsford, Carl

Zdroj: Algorithms for Molecular Biology; 4/29/2024, Vol. 19 Issue 1, p1-24, 24p

Témata: GRAPH algorithms, EULERIAN graphs, DE Bruijn graph, LINEAR programming, POLYNOMIAL time algorithms, SOURCE code, NP-complete problems

A heuristic algorithm using tree decompositions for the maximum happy vertices problem.

Autoři: Carpentier, Louis Jooken, Jorik Goedgebeur, Jan

Zdroj: Journal of Heuristics; Apr2024, Vol. 30 Issue 1/2, p67-107, 41p

Témata: DYNAMIC programming, GRAPH algorithms, COMBINATORIAL optimization, ALGORITHMS

Polynomial time algorithms for the token swapping problem on cographs.

Autoři: Tonetti, Caio Henrique Segawa dos Santos, Vinicius Fernandes Urrutia, Sebastián

Zdroj: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 1, p441-455, 15p

Témata: POLYNOMIAL time algorithms, GRAPH theory, GRAPH algorithms, PETRI nets

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471)

Autoři: Censor-Hillel, Keren Nazari, Yasamin Rotenberg, Eva a další

Přispěvatelé: Censor-Hillel, Keren Nazari, Yasamin Rotenberg, Eva a další

Témata: distributed algorithms, dynamic algorithms

Popis souboru: application/pdf

Relation: Is Part Of Dagstuhl Reports, Volume 14, Issue 11 (2025); https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.11.92

Dostupnost: https://doi.org/10.4230/DagRep.14.11.92
https://nbn-resolving.org/urn:nbn:de:0030-drops-228186
https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.11.92