„Graph algorithms“
Suchergebnisse
3.156 Treffer
-
Simple (Invited Talk)
-
Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs
-
Learning-Augmented Maximum Independent Set
-
A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
-
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
-
Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
-
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
-
Structural Parameters for Dense Temporal Graphs
-
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
-
Algorithms and Complexity for Path Covers of Temporal DAGs
-
First-Fit Coloring of Forests in Random Arrival Model
-
Breaking a Graph into Connected Components with Small Dominating Sets
-
The Canadian Traveller Problem on Outerplanar Graphs
-
Sparse Graphic Degree Sequences Have Planar Realizations
-
Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs
-
Sublinear Time Shortest Path in Expander Graphs
-
Solving Unique Games over Globally Hypercontractive Graphs
-
Practical Minimum Path Cover
-
Better Sparsifiers for Directed Eulerian Graphs
-
On the Cut-Query Complexity of Approximating Max-Cut