Parameterized computational complexity of finding small-diameter subgraphs
- Schäfer, A.
- Komusiewicz, C.
- Moser, H.
- Niedermeier, R.
Publication date
June 2012
DOI Publisher
Springer Science and Business Media LLCAbstract
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
Add to ORKG