An algorithm for destroying claws and diamonds (1908.07318v1)

Published 20 Aug 2019 in cs.DS

Abstract: In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of edges of size at most $k$ such that removing the edges of the set from $G$ results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is $O^{*(3.562^k)$.}

Citations (1)

View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Dekel Tsur

Collections

Sign up for free to add this paper to one or more collections.