Pages that link to "Item:Q2354725"
From MaRDI portal
The following pages link to An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725):
Displaying 15 items.
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Finding supported paths in heterogeneous networks (Q1736715) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5091007) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Enumerating connected induced subgraphs: improved delay and experimental comparison (Q5918096) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- (Q6065417) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
