Novel approaches for analyzing biological networks
From MaRDI portal
Publication:2576439
DOI10.1007/s10878-005-1857-xzbMath1080.90010OpenAlexW2010661649MaRDI QIDQ2576439
Sergiy I. Butenko, Svyatoslav Trukhanov, Balabhaskar Balasundaram
Publication date: 13 December 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-1857-x
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Integer programming (90C10) Deterministic network models in operations research (90B10) General biology and biomathematics (92B05)
Related Items (58)
The triangle \(k\)-club problem ⋮ Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Isolation concepts for efficiently enumerating dense subgraphs ⋮ Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights ⋮ Finding disjoint dense clubs in a social network ⋮ Approximating 2-cliques in unit disk graphs ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Two-phase heuristics for the \(k\)-club problem ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ Integer models and upper bounds for the 3‐club problem ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ Approximating maximum diameter-bounded subgraph in unit disk graphs ⋮ Algorithms for the maximum \(k\)-club problem in graphs ⋮ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ On atomic cliques in temporal graphs ⋮ Finding clubs in graph classes ⋮ On the tractability of finding disjoint clubs in a network ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ On the 2-Club Polytope of Graphs ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ On biconnected and fragile subgraphs of low diameter ⋮ On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems ⋮ Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems ⋮ On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs ⋮ Covering a Graph with Clubs ⋮ Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments ⋮ Parsimonious formulations for low-diameter clusters ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Graph signatures: identification and optimization ⋮ On robust clusters of minimum cardinality in networks ⋮ Detecting large risk-averse 2-clubs in graphs with random edge failures ⋮ Parameterized computational complexity of finding small-diameter subgraphs ⋮ An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem ⋮ Upper bounds and heuristics for the 2-club problem ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ The parameterized complexity of \(s\)-club with triangle and seed constraints ⋮ The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ On the tractability of covering a graph with 2-clubs ⋮ Distance-Based Clique Relaxations in Networks: s-Clique and s-Club ⋮ Exact algorithms for the minimum \(s\)-club partitioning problem ⋮ Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs ⋮ On structural parameterizations for the 2-club problem ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems ⋮ Algorithms and complexity of \(s\)-club cluster vertex deletion ⋮ On connected dominating sets of restricted diameter
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the maximum clique problem
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- Emergence of Scaling in Random Networks
- A graph‐theoretic definition of a sociometric clique†
- Collective dynamics of ‘small-world’ networks
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
This page was built for publication: Novel approaches for analyzing biological networks
