Finding events in temporal networks: segmentation meets densest subgraph discovery - Rozenshtein, Polina; Bonchi, Francesco; Gionis, Aristides; Sozio, Mauro; Tatti, Nikolaj (Knowledge and information systems, 2020)
Keywords: Approximation; Computer Science; Data Mining and Knowledge Discovery; Database Management; Dynamic programming; Graph theory; Greedy algorithms; Information Storage and Retrieval; Information Systems and Communication Service; Information Systems Applications (incl.Internet); Intervals; IT in Business; Optimization; Polynomials; Regular Paper; Run time (computers); Segmentation; Densest subgraph; Dynamic programming; Approximate algorithm; Segmentation