Pages that link to "Item:Q837155"
From MaRDI portal
The following pages link to Isolation concepts for efficiently enumerating dense subgraphs (Q837155):
Displaying 25 items.
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- A classification for community discovery methods in complex networks (Q4969805) (← links)
- Linear-time algorithm for generating c-isolated bicliques (Q4976342) (← links)
- (Q5111877) (← links)
- (Q6065417) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
