Back to Results
First PageMeta Content
NP-complete problems / Graph operations / Analysis of algorithms / Parameterized complexity / Feedback vertex set / Tree decomposition / Vertex cover / Dominating set / Kernelization / Graph theory / Theoretical computer science / Mathematics


Preprint. To appear in Algorithmica. DOIs00453 – Online available. On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion Nadja Betzler1 · Hans L. Bodlaender ·
Add to Reading List

Document Date: 2012-10-16 08:46:15

Open Document

File Size: 426,69 KB

Share Result on Facebook

City

Smokovec / /

Company

Vertex / /

Country

Slovakia / /

/

Facility

Computing Sciences Utrecht University / /

IndustryTerm

fixed-parameter algorithms / sparse social networks / present specific fixed-parameter algorithms / decomposition-based dynamic programming algorithm / dynamic programming algorithm / linear-time algorithm / search tree / undirected social networks / size-k solution / /

Organization

de Hans L. Bodlaender Department of Information / Johannes Uhlmann Institut f¨ / Utrecht University / /

Person

Nadja Betzler / Hans L. Bodlaender / Rolf Niedermeier / Ai / Robert Bredereck / Johannes Uhlmann / /

ProvinceOrState

Maryland / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

fixed-parameter algorithms / decomposition-based dynamic programming algorithm / dynamic programming algorithm / linear-time algorithm / subsequently present specific fixed-parameter algorithms / /

SocialTag