Finding conserved low-diameter subgraphs in social and biological networks
type: Item
instance of: scholarly article
title: Finding conserved low-diameter subgraphs in social and biological networks
author: Hao Pan
author: Yajun Lu
author: B. Balasundaram
author: Juan S. Borrero
published in: Networks
publication date: 2025-01-08T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7963651
zbMATH Keywords: \( k \)-clubs-clubs
zbMATH Keywords: cross-graph mining
zbMATH Keywords: integer programming
zbMATH Keywords: temporal networks
MaRDI profile type: MaRDI publication profile
cites work: Q4945528
cites work: A graph‐theoretic definition of a sociometric clique†
cites work: Length-bounded cuts and flows
cites work: Graph signatures: identification and optimization
cites work: Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
cites work: Novel approaches for analyzing biological networks
cites work: Heuristics for finding \(k\)-clubs in an undirected graph
cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
cites work: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
cites work: On atomic cliques in temporal graphs
cites work: Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts''
cites work: On Fault-Tolerant Low-Diameter Clusters in Graphs
cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
cites work: On the 2-Club Polytope of Graphs
cites work: An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
cites work: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
cites work: On clique relaxation models in network analysis
cites work: Parsimonious formulations for low-diameter clusters
cites work: Parameterized computational complexity of finding small-diameter subgraphs
cites work: Finding lasting dense subgraphs
cites work: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
cites work: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
cites work: Computing maximal cliques in link streams
DOI: 10.1002/NET.22246
description: scientific article; zbMATH DE number 7963651