TY - GEN

T1 - Finding highly connected subgraphs

AU - Hüffner, Falk

AU - Komusiewicz, Christian

AU - Sorge, Manuel

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We first observe that this problem is NP-hard. Thus, we explore possible parameterizations, such as the solution size, number of vertices in the input, the size of a vertex cover in the input, and the number of edges outgoing from the solution (edge isolation), and expose their influence on the complexity of this problem. For some parameters, we find strong intractability results; among the parameters yielding tractability, the edge isolation seems to provide the best trade-off between running time bounds and a small parameter value in relevant instances.

AB - A popular way of formalizing clusters in networks are highly connected subgraphs, that is, subgraphs of k vertices that have edge connectivity larger than k/2 (equivalently, minimum degree larger than k/2). We examine the computational complexity of finding highly connected subgraphs. We first observe that this problem is NP-hard. Thus, we explore possible parameterizations, such as the solution size, number of vertices in the input, the size of a vertex cover in the input, and the number of edges outgoing from the solution (edge isolation), and expose their influence on the complexity of this problem. For some parameters, we find strong intractability results; among the parameters yielding tractability, the edge isolation seems to provide the best trade-off between running time bounds and a small parameter value in relevant instances.

UR - http://www.scopus.com/inward/record.url?scp=84922022455&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-46078-8_21

DO - 10.1007/978-3-662-46078-8_21

M3 - Conference contribution

AN - SCOPUS:84922022455

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 254

EP - 265

BT - SOFSEM 2015

A2 - Italiano, Giuseppe F.

A2 - Margaria-Steffen, Tiziana

A2 - Pokorný, Jaroslav

A2 - Quisquater, Jean-Jacques

A2 - Wattenhofer, Roger

PB - Springer Verlag

T2 - 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015

Y2 - 24 January 2015 through 29 January 2015

ER -