On atomic cliques in temporal graphs
From MaRDI portal
Publication:6043101
DOI10.1007/s11590-023-01975-0zbMath1518.90093MaRDI QIDQ6043101
Zhuqi Miao, Balabhaskar Balasundaram, Parisa Sahraeian, Yajun Lu
Publication date: 4 May 2023
Published in: Optimization Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- On finding \(k\)-cliques in \(k\)-partite graphs
- A network-based data mining approach to portfolio selection via weighted clique relaxations
- Computing maximal cliques in link streams
- On the maximum quasi-clique problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- Worst-case analysis of clique MIPs
- Graph signatures: identification and optimization
- On clique relaxation models in network analysis
- A survey of computational methods in protein-protein interaction networks
- The maximum ratio clique problem
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
- On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
- Why Is Maximum Clique Often Easy in Practice?
- A Note on Performance Profiles for Benchmarking Software
- Benchmarking optimization software with performance profiles.
- On maximum ratio clique relaxations
This page was built for publication: On atomic cliques in temporal graphs
