This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the ...
Abstract: In railway transportation systems, train section running times are usually uncertain due to the influence of various complex factors, making rescheduled timetables difficult to use ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results