Papers

Topics

Authors

Recent

View all

Detailed Answer

Quick Answer

Concise responses based on abstracts only

Detailed Answer

Well-researched responses based on abstracts and relevant paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses

Gemini 2.5 Flash

Gemini 2.5 Flash 91 tok/s

Gemini 2.5 Pro 56 tok/s Pro

GPT-5 Medium 29 tok/s Pro

GPT-5 High 29 tok/s Pro

GPT-4o 108 tok/s Pro

Kimi K2 214 tok/s Pro

GPT OSS 120B 470 tok/s Pro

Claude Sonnet 4 40 tok/s Pro

2000 character limit reached

Cluster deletion revisited (1907.08399v1)

Published 19 Jul 2019 in cs.DS

Abstract: In the Cluster Deletion problem the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of at most $k$ edges whose removal from $G$ results a graph in which every connected component is a clique. In this paper we give an algorithm for Cluster Deletion whose running time is $O^{*(1.404^k)$.}

Citations (5)

View on Semantic Scholar