English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Parameterized computational complexity of finding small-diameter subgraphs

Schäfer, A., Komusiewicz, C., Moser, H., & Niedermeier, R. (2012). Parameterized computational complexity of finding small-diameter subgraphs. Optimization Letters, 6(5), 883-891. doi:10.1007/s11590-011-0311-5.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0011-F31A-5 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-002B-C423-D
Genre: Journal Article

Files

show Files
hide Files
:
Schaefer_2012_Parameterized.pdf (Publisher version), 231KB
 
File Permalink:
-
Name:
Schaefer_2012_Parameterized.pdf
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Schäfer, Alexander1, Author              
Komusiewicz, Christian2, Author
Moser, Hannes3, Author
Niedermeier, Rolf2, Author
Affiliations:
1Department Neurology, MPI for Human Cognitive and Brain Sciences, Max Planck Society, ou_634549              
2Department of Software Engineering and Theoretical Computer Science, TU Berlin, Germany, ou_persistent22              
3Department of Computer Science, Friedrich Schiller University Jena, Germany, ou_persistent22              

Content

show
hide
Free keywords: Clique relaxation; s-Club; NP-hard problem; Problem kernel; Polynomial-time preprocessing; Branching algorithm
 Abstract: Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s-Club problem. We consider two parameters: the solution size and its dual.

Details

show
hide
Language(s): eng - English
 Dates: 2011-04-052012-06-01
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: DOI: 10.1007/s11590-011-0311-5
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Optimization Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: 6 (5) Sequence Number: - Start / End Page: 883 - 891 Identifier: ISSN: 1862-4472
CoNE: https://pure.mpg.de/cone/journals/resource/1862-4472