Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cluster deletion revisited

From MaRDI portal
Publication:2234801
Jump to:navigation, search

DOI10.1016/j.ipl.2021.106171zbMath1476.05191arXiv1907.08399OpenAlexW3185869980MaRDI QIDQ2234801

Dekel Tsur

Publication date: 19 October 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.08399


zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Structural parameterization of cluster deletion ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules



Cites Work

  • Graph-modeled data clustering: Exact algorithms for clique generation
  • Automated generation of search tree algorithms for hard graphs modification problems
  • Even faster parameterized cluster deletion and cluster editing
  • Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms




This page was built for publication: Cluster deletion revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2234801&oldid=14776579"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 05:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki