Finding conserved low-diameter subgraphs in social and biological networks

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Cites Work

Title not available (Why is that?)
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
Computing maximal cliques in link streams
An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
Parameterized computational complexity of finding small-diameter subgraphs
Heuristics for finding \(k\)-clubs in an undirected graph
Finding lasting dense subgraphs
Parsimonious formulations for low-diameter clusters
Graph signatures: identification and optimization
On clique relaxation models in network analysis
Solving the maximum clique problem using a tabu search approach
Novel approaches for analyzing biological networks
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
On the 2-Club Polytope of Graphs
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Length-bounded cuts and flows
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
A graph‐theoretic definition of a sociometric clique†
On Fault-Tolerant Low-Diameter Clusters in Graphs
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
On atomic cliques in temporal graphs

This page was built for publication: Finding conserved low-diameter subgraphs in social and biological networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659091)