The parameterized complexity of \(s\)-club with triangle and seed constraints
From MaRDI portal
Publication:6056631
DOI10.1007/s00224-023-10135-xzbMath1525.05034MaRDI QIDQ6056631
Christian Komusiewicz, Jaroslav Garvardt, Frank Sommer
Publication date: 30 October 2023
Published in: Theory of Computing Systems (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial optimization (90C27) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Fundamentals of parameterized complexity
- Finding clubs in graph classes
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Finding large \(k\)-clubs in undirected graphs
- On problems without polynomial kernels
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- On biconnected and fragile subgraphs of low diameter
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Multivariate algorithmics for finding cohesive subnetworks
- Parameterized computational complexity of finding small-diameter subgraphs
- On clique relaxation models in network analysis
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- On structural parameterizations for the 2-club problem
- The triangle \(k\)-club problem
- Novel approaches for analyzing biological networks
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Parameterized Algorithms
This page was built for publication: The parameterized complexity of \(s\)-club with triangle and seed constraints
