Local Search for Group Closeness Maximization on Big Graphs

@article{Angriman2019LocalSF,
  title={Local Search for Group Closeness Maximization on Big Graphs},
  author={Eugenio Angriman and Alexander van der Grinten and Henning Meyerhenke},
  journal={2019 IEEE International Conference on Big Data (Big Data)},
  year={2019},
  pages={711-720}
}
  • Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
  • Published in
    IEEE International Conference…
    2019
  • Computer Science, Mathematics
  • In network analysis and graph mining, closeness centrality is a popular measure to infer the importance of a vertex. Computing closeness efficiently for individual vertices received considerable attention. The NP-hard problem of group closeness maximization, in turn, is more challenging: the objective is to find a vertex group that is central as a whole and state-of the-art heuristics for it do not scale to very big graphs yet.In this paper, we present new local search heuristics for group… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES

    R-MAT: A Recursive Model for Graph Mining

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficient Maximum Closeness Centrality Group Identification

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Size-Estimation Framework with Applications to Transitive Closure and Reachability

    • Edith Cohen
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 1997
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Networks, 2nd ed

    • M. Newman
    • Oxford university press,
    • 2018
    VIEW 1 EXCERPT

    Generating massive complex networks with hyperbolic geometry faster in practice

    VIEW 1 EXCERPT

    Efficient top-k closeness centrality search

    VIEW 1 EXCERPT