Editing graphs to satisfy degree constraints: A parameterized approach

Mathieson, L; Szeider, S

Editing graphs to satisfy degree constraints: A parameterized approach

Mathieson, L

Szeider, S

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computer and System Sciences, 2012, 78 (1), pp. 179 - 191
Issue Date:: 2012-01-01

Closed Access

	Filename	Description	Size
	1-s2.0-S0022000011000067-main.pdf	Published Version	253.65 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mathieson, L https://orcid.org/0000-0001-6470-2296	en_US
dc.contributor.author	Szeider, S	en_US
dc.date.issued	2012-01-01	en_US
dc.identifier.citation	Journal of Computer and System Sciences, 2012, 78 (1), pp. 179 - 191	en_US
dc.identifier.issn	0022-0000	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115380
dc.description.abstract	We study a wide class of graph editing problems that ask whether a given graph can be modified to satisfy certain degree constraints, using a limited number of vertex deletions, edge deletions, or edge additions. The problems generalize several well-studied problems such as the General Factor Problem and the Regular Subgraph Problem. We classify the parameterized complexity of the considered problems taking upper bounds on the number of editing steps and the maximum degree of the resulting graph as parameters. © 2011 Elsevier Inc. All rights reserved.	en_US
dc.relation.ispartof	Journal of Computer and System Sciences	en_US
dc.relation.isbasedon	10.1016/j.jcss.2011.02.001	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Editing graphs to satisfy degree constraints: A parameterized approach	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	78	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0806 Information Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	78	en_US

Abstract:

We study a wide class of graph editing problems that ask whether a given graph can be modified to satisfy certain degree constraints, using a limited number of vertex deletions, edge deletions, or edge additions. The problems generalize several well-studied problems such as the General Factor Problem and the Regular Subgraph Problem. We classify the parameterized complexity of the considered problems taking upper bounds on the number of editing steps and the maximum degree of the resulting graph as parameters. © 2011 Elsevier Inc. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/115380