Isolation concepts for efficiently enumerating dense subgraphs
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Recommendations
- Isolation Concepts for Enumerating Dense Subgraphs
- On Finding Dense Subgraphs
- Finding Dense Subgraphs with Size Bounds
- Complexity of finding dense subgraphs
- Finding dense subgraphs
- Finding dense subgraphs of sparse graphs
- In search of the densest subgraph
- Isolating highly connected induced subgraphs
- Isolation concepts for clique enumeration: comparison and computational experiments
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A generalization of Nemhauser and Trotter's local optimization theorem
- A graph‐theoretic generalization of the clique concept
- Algorithms for maximum independent sets
- Algorithms – ESA 2005
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique relaxations in social network analysis: the maximum k-plex problem
- Clique-detection models in computational biochemistry and genomics
- Enumerating Isolated Cliques in Synthetic and Financial Networks
- Enumeration of isolated cliques and pseudo-cliques
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Isolation Concepts for Enumerating Dense Subgraphs
- Measure and conquer
- Network Analysis
- Novel approaches for analyzing biological networks
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Parametrized complexity theory.
- The node-deletion problem for hereditary properties is NP-complete
- The worst-case time complexity for generating all maximal cliques and computational experiments
Cited in
(28)- Multivariate algorithmics for finding cohesive subnetworks
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Enumerating Isolated Cliques in Synthetic and Financial Networks
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- A generalization of Nemhauser and Trotter's local optimization theorem
- Linear-time algorithm for generating c-isolated bicliques
- Structural parameterizations of the biclique-free vertex deletion problem
- An efficient algorithm for solving pseudo clique enumeration problem
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Hardness and tractability of the \(\gamma\)-complete subgraph problem
- On bounded-degree vertex deletion parameterized by treewidth
- On structural parameterizations of the bounded-degree vertex deletion problem
- Computing dense and sparse subgraphs of weakly closed graphs
- Enumeration of isolated cliques and pseudo-cliques
- On the parameterized complexity of maximum degree contraction problem
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- Finding connected secluded subgraphs
- Isolation Concepts for Enumerating Dense Subgraphs
- Finding connected secluded subgraphs
- A classification for community discovery methods in complex networks
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- On structural parameterizations of the bounded-degree vertex deletion problem
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- On the parameterized complexity of non-hereditary relaxations of clique
This page was built for publication: Isolation concepts for efficiently enumerating dense subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837155)
