Pages that link to "Item:Q1040581"
From MaRDI portal
The following pages link to Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581):
Displaying 9 items.
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← 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)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- Enumeration of isolated cliques and pseudo-cliques (Q2930266) (← links)
- Linear-time algorithm for generating c-isolated bicliques (Q4976342) (← links)
- (Q5111877) (← links)
- Algorithms – ESA 2005 (Q5475825) (← links)