Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Data Structures and Algorithms

arXiv:1606.03268 (cs)
[Submitted on 10 Jun 2016]

Title:Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics

Authors:Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
View PDF
Abstract:In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in numerous applications, including the analysis of biological and social networks. Typically, graph modification problems are NP-hard, making them natural candidates for parameterized complexity studies. We discuss several fruitful interactions between the development of fixed-parameter algorithms and the design of heuristics for graph modification problems, featuring quite different aspects of mutual benefits.
Comments: Invited Paper at the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 15)
Subjects: Data Structures and Algorithms (cs.DS)
MSC classes: 05C85
Cite as: arXiv:1606.03268 [cs.DS]
  (or arXiv:1606.03268v1 [cs.DS] for this version)
  https://doi.org/10.48550/arXiv.1606.03268

Submission history

From: André Nichterlein [view email]
[v1] Fri, 10 Jun 2016 10:50:28 UTC (21 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2016-06
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Christian Komusiewicz
André Nichterlein
Rolf Niedermeier
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)