The parameterized complexity of s-club with triangle and seed constraints

DOI10.1007/978-3-031-06678-8_23MaRDI QIDQ2169965zbMATH OpenOpenAlexFDO

Authors Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer

Publication date 30 August 2022

Full work available at URL https://arxiv.org/abs/2201.05654

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
• Finding clubs in graph classes
• Finding large k-clubs in undirected graphs
• Fundamentals of parameterized complexity
• Identifying large robust network clusters via new compact formulations of maximum k-club problems
• Multivariate algorithmics for finding cohesive subnetworks
• Novel approaches for analyzing biological networks
• On biconnected and fragile subgraphs of low diameter
• On clique relaxation models in network analysis
• On problems without polynomial kernels
• Parameterized algorithmics and computational experiments for finding 2-clubs
• Parameterized algorithms
• Parameterized computational complexity of finding small-diameter subgraphs
• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
• The triangle \(k\)-club problem

This page was built for publication: The parameterized complexity of \(s\)-club with triangle and seed constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169965)