Pages that link to "Item:Q2576439"
From MaRDI portal
The following pages link to Novel approaches for analyzing biological networks (Q2576439):
Displaying 50 items.
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Detecting large risk-averse 2-clubs in graphs with random edge failures (Q513610) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Graph signatures: identification and optimization (Q2242325) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- The triangle \(k\)-club problem (Q2359790) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
