On atomic cliques in temporal graphs
From MaRDI portal
Publication:6043101
DOI10.1007/S11590-023-01975-0zbMATH Open1518.90093MaRDI QIDQ6043101FDOQ6043101
Authors: Yajun Lu, Zhuqi Miao, Parisa Sahraeian, B. Balasundaram 
Publication date: 4 May 2023
Published in: Optimization Letters (Search for Journal in Brave)
Recommendations
Cites Work
- A note on performance profiles for benchmarking software
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- On the maximum quasi-clique problem
- On clique relaxation models in network analysis
- Clique-detection models in computational biochemistry and genomics
- Novel approaches for analyzing biological networks
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- 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
- Graph domination, coloring and cliques in telecommunications
- Graph signatures: identification and optimization
- The maximum ratio clique problem
- On maximum ratio clique relaxations
- On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches
- Worst-case analysis of clique MIPs
- Why is maximum clique often easy in practice?
- A survey of computational methods in protein-protein interaction networks
- An ellipsoidal bounding scheme for the quasi-clique number of a graph
Cited In (1)
This page was built for publication: On atomic cliques in temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043101)
