Search

Your search keyword '"Mertzios, George B."' showing total 29 results
Start Over Author "Mertzios, George B." Publisher elsevier bv
29 results on '"Mertzios, George B."'

11. Graph editing to a given degree sequence

Author

Golovach, Petr A. and Mertzios, George B.

Subjects
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), General Computer Science, 010102 general mathematics, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Theoretical Computer Science, Computer Science - Computational Complexity, 010201 computation theory & mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, MathematicsofComputing_DISCRETEMATHEMATICS, Computer Science - Discrete Mathematics
Abstract

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given degree sequence \sigma by at most k vertex or edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2^{O(k(\Delta+k)^2)}n^2 log n for n-vertex graphs, where \Delta=max \sigma, i.e., the problem is FPT when parameterized by k+\Delta. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+\Delta if only edge additions are allowed, and there is no polynomial kernel unless NP\subseteq coNP/poly for all other combinations of allowed editing operations., Comment: arXiv admin note: text overlap with arXiv:1311.4768

Published
2017
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results