Multivariate algorithmics for finding cohesive subnetworks
From MaRDI portal
Publication:1736776
DOI10.3390/a9010021zbMath1461.05213OpenAlexW2300144455MaRDI QIDQ1736776
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a9010021
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ On the tractability of finding disjoint clubs in a network ⋮ Covering a graph with densest subgraphs ⋮ Computing dense and sparse subgraphs of weakly closed graphs ⋮ On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems ⋮ Unnamed Item ⋮ Covering a Graph with Clubs ⋮ Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments ⋮ Dense Subgraphs in Biological Networks ⋮ Dense subgraphs in random graphs ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems ⋮ On the tractability of covering a graph with 2-clubs ⋮ Computing the \(k\) densest subgraphs of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Finding maximum subgraphs with relatively large vertex connectivity
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Fundamentals of parameterized complexity
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Finding large \(k\)-clubs in undirected graphs
- Editing graphs into disjoint unions of dense clusters
- A generalization of Nemhauser and Trotter's local optimization theorem
- Improved upper bounds for vertex cover
- A branch-and-bound approach for maximum quasi-cliques
- Isolation concepts for efficiently enumerating dense subgraphs
- Isolation concepts for clique enumeration: comparison and computational experiments
- The node-deletion problem for hereditary properties is NP-complete
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Which problems have strongly exponential complexity?
- A clustering algorithm based on graph connectivity
- Parameterized computational complexity of finding small-diameter subgraphs
- On the maximum quasi-clique problem
- Parameterized complexity of finding subgraphs with hereditary properties.
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Heuristics for finding \(k\)-clubs in an undirected graph
- On clique relaxation models in network analysis
- On structural parameterizations for the 2-club problem
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Scalable parallel algorithms for FPT problems
- Tight lower bounds for certain parameterized NP-hard problems
- Novel approaches for analyzing biological networks
- On Editing Graphs into 2-Club Clusters
- New Races in Parameterized Algorithmics
- Enumeration of isolated cliques and pseudo-cliques
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Finding Highly Connected Subgraphs
- A survey on alliances and related parameters in graphs
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Parameterized Algorithms
- A Graph-Theoretic Approach to a Communications Problem
- Network Analysis
- The dense \(k\)-subgraph problem
This page was built for publication: Multivariate algorithmics for finding cohesive subnetworks
