„Almost-Clique“

Suchergebnisse

7 Treffer

• Almost Polynomial Factor Inapproximability for Parameterized k-Clique
  Khot, Subhash ; Karthik C. S. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization
  Erlebach, Thomas ; Morawietz, Nils ; Wolf, Petra 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
  Eden, Talya ; Ron, Dana ; Rosenbaum, Will 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
  Ducoffe, Guillaume 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
  Ducoffe, Guillaume
• Finite almost simple groups with prime graphs all of whose connected components are cliques
  Zinov’eva, M. R. ; Kondrat’ev, A. S.