descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 2014Publisher:Tsinghua University PressJournal:Tsinghua Science and Technology, volume 19, pages 346-357 (eissn: 1007-0214,

Authors: null Yunlong Liu; null Jianxin Wang; null Jiong Guo;

doi: 10.1109/tst.2014.6867517

An overview of kernelization algorithms for graph modification problems

- Summary
- Metrics

Abstract

Kernelization algorithms for graph modification problems are important ingredients in parameterized computation theory. In this paper, we survey the kernelization algorithms for four types of graph modification problems, which include vertex deletion problems, edge editing problems, edge deletion problems, and edge completion problems. For each type of problem, we outline typical examples together with recent results, analyze the main techniques, and provide some suggestions for future research in this field.

Related Organizations

Central South University
China (People's Republic of)
Saarland University
Germany

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average