Efficient temporal core maintenance of massive graphs
From MaRDI portal
Publication:2660743
DOI10.1016/j.ins.2019.11.003zbMath1457.68201OpenAlexW2988482008WikidataQ110612298 ScholiaQ110612298MaRDI QIDQ2660743
Publication date: 31 March 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.11.003
Related Items (2)
Generalized core maintenance of dynamic bipartite graphs ⋮ OCSM: finding overlapping cohesive subgraphs with minimum degree
Uses Software
Cites Work
- Finding quasi core with simulated stacked neural networks
- New heuristic approaches for maximum balanced biclique problem
- Computing maximal cliques in link streams
- Mining frequent subgraphs in multigraphs
- Nonnegative matrix factorization with mixed hypergraph regularization for community detection
- Bratteli diagrams where random orders are imperfect
This page was built for publication: Efficient temporal core maintenance of massive graphs