A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2020.3025463
Abstract: One important problem that is insufficiently studied is finding densest lasting-subgraphs in large dynamic graphs, which considers the time duration of the subgraph pattern. We propose a framework called Expectation-Maximization with Utility functions (EMU), a… read more here.
Keywords: finding densest; stochastic approach; dynamic graphs; densest temporal ... See more keywords