„Almost-Clique“
Suchergebnisse
7 Treffer
-
Almost Polynomial Factor Inapproximability for Parameterized k-Clique
-
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization
-
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
-
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
-
Finite almost simple groups with prime graphs all of whose connected components are cliques