Suchergebnisse - "Graph Algorithms"

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

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

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

Schlagwörter: *ALGORITHMS, GRAPH algorithms, GRAPH theory, COMPUTATIONAL complexity

Flow-augmentation I: Directed graphs.

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

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

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

An efficient query recovery attack against a graph encryption scheme.

Autoren: Falzon, Francesca Paterson, Kenneth G.

Quelle: Journal of Computer Security. Nov2025, Vol. 33 Issue 6, p402-424. 23p.

Schlagwörter: *DATA encryption, *COMPUTER security, GRAPH algorithms, QUERY (Information retrieval system)

Efficient polynomial-time approximation scheme for the genus of dense graphs.

Autoren: Jing, Yifan Mohar, Bojan

Quelle: Journal of the ACM. Dec2024, Vol. 71 Issue 6, p1-33. 33p.

Schlagwörter: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

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

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

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

Schlagwörter: *ALGORITHMS, GRAPH algorithms, OPEN-ended questions

Killing a Vortex.

Autoren: Thilikos, Dimitrios M. Wiederrecht, Sebastian

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

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, GENERATING functions, MINORS, COUNTING, BIPARTITE graphs

Tackling Challenges in Implementing Large-Scale Graph Databases.

Autoren: Arroyuelo, Diego Hogan, Aidan Navarro, Gonzalo et al.

Quelle: Communications of the ACM. Aug2024, Vol. 67 Issue 8, p40-44. 5p.

Schlagwörter: *DATABASES, *DATA structures, *RELATIONAL databases, GRAPH algorithms, QUERY languages (Computer science), DATA modeling

A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees.

Autoren: Mathieu, Claire Zhou, Hang

Quelle: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p115-146. 32p.

Schlagwörter: VEHICLE routing problem, GRAPH algorithms, POLYNOMIAL time algorithms, COMBINATORIAL optimization, POLYNOMIAL approximation

Graph Algorithm Based Submodular Function for Sparsest Cut Problem.

Autoren: Zhang, Xiaoyan Chang, Hong Guo, Longkun et al.

Quelle: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p619-633. 15p.

Schlagwörter: GRAPH algorithms, SUBMODULAR functions, FLOWGRAPHS, IMAGE segmentation, NP-hard problems, WEIGHTED graphs

Verification of a certificate for weakly chordal graphs.

Autoren: Spinrad, Jeremy P. Sritharan, R.

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 376, p186-192. 7p.

Schlagwörter: *DENSE graphs, *GRAPH algorithms, *GRAPH theory, *TIME complexity

Towards distributed two-stage stochastic optimization.

Autoren: Emek, Yuval Harlev, Noga Izumi, Taisuke

Quelle: Distributed Computing. Dec2025, Vol. 38 Issue 4, p377-395. 19p.

Schlagwörter: *STOCHASTIC programming, *GRAPH algorithms, *PARALLEL programming, *DISTRIBUTION (Probability theory), *MONTE Carlo method, *DISCRETE systems

Spanning cactus and spanning cactus extension of outerplanar graphs.

Autoren: Debnath, Chinmay Datta, Alak Kumar

Quelle: Acta Informatica. Dec2025, Vol. 62 Issue 4, p1-14. 14p.

Schlagwörter: *PLANAR graphs, *GRAPH algorithms, *GRAPH theory, *ALGORITHMS, *GRAPH connectivity, *SPANNING trees

LCSkPOA: enabling banded semi-global partial order alignments via efficient and accurate backbone generation through extended LCSk++.

Autoren: Weerakoon, Minindu Saunders, Christopher T. Heaton, Haynes

Quelle: BMC Bioinformatics. 11/25/2025, Vol. 26 Issue 1, p1-16. 16p.

Schlagwörter: *SEQUENCE alignment, *GRAPH algorithms, *PARALLEL processing, *BIOINFORMATICS, *DYNAMIC programming

Neural subgraph counting on stream graphs via localized updates and monotonic learning.

Autoren: Xie, Zhen Hou, Wenzhe Wu, Feiyang et al.

Quelle: PLoS ONE. 10/23/2025, Vol. 20 Issue 10, p1-24. 24p.

Schlagwörter: *GRAPH algorithms, *MACHINE learning, *FLOWGRAPHS, *REPRESENTATIONS of graphs

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs.

Autoren: Yamada, Suguru Hanaka, Tesshu

Quelle: Discrete Applied Mathematics. Oct2025, Vol. 373, p343-354. 12p.

Schlagwörter: *REAL numbers, *GRAPH algorithms, *UNDIRECTED graphs, *SPARSE graphs, *INTEGERS, *WEIGHTED graphs

Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity.

Autoren: Balabán, Jakub Ganian, Robert Rocton, Mathis

Quelle: SIAM Journal on Discrete Mathematics. 2025, Vol. 39 Issue 4, p2102-2141. 40p.

Schlagwörter: *GRAPH theory, *GRAPH algorithms

A Graph-Based Algorithm for Detecting Long Non-Coding RNAs Through RNA Secondary Structure Analysis.

Autoren: Cabrera-Ibarra, Hugo Hernández-Granados, David Riego-Ruiz, Lina

Quelle: Algorithms. Oct2025, Vol. 18 Issue 10, p652. 18p.

Schlagwörter: *GRAPH algorithms, *STRUCTURAL analysis (Science), *LINCRNA, *RNA, *BIOMARKERS, *NUCLEOTIDE sequence

High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree.

Autoren: Ma, Ronghua Yao, Weibin

Quelle: Mathematical Methods in the Applied Sciences. Oct2025, Vol. 48 Issue 15, p14110-14120. 11p.

Schlagwörter: *DENSE graphs, *GRAPH algorithms, *TREE pruning, *GRAPH theory, *OPTIMIZATION algorithms, *HEURISTIC

Edge-based quantum approximate optimization algorithm for MAX-CUT problem.

Autoren: Seo, Youngjin Heo, Jun

Quelle: Quantum Information Processing. Oct2025, Vol. 24 Issue 10, p1-32. 32p.

Schlagwörter: *COMBINATORIAL optimization, *GRAPH algorithms, *GRAPH theory, *QUANTUM information science, *QUANTUM graph theory, *QUANTUM computing

Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs

Autoren: Cicerone S. Di Stefano G.

Quelle: Discrete Applied Mathematics. 376:359-373

Schlagwörter: Computational complexity, Distance-hereditary graphs, Graph algorithms, Graph classes, Mutual-visibility, Split decomposition

Dateibeschreibung: application/pdf