Advertisement

Optimal Partition of a Tree with Social Distance

  • Masahiro OkuboEmail author
  • Tesshu HanakaEmail author
  • Hirotaka OnoEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11355)

Abstract

We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.

Keywords

Graph algorithm Tree Graph partition Social distance 

References

  1. 1.
    Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316–334 (2013)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Balliu, A., Flammini, M., Melideo, G., Olivetti, D.: Nash stability in social distance games. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 342–348 (2017)Google Scholar
  3. 3.
    Balliu, A., Flammini, M., Olivetti, D.: On pareto optimality in social distance games. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 349–355 (2017)Google Scholar
  4. 4.
    Brânzei, S., Larson, K.: Social distance games. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 91–96 (2011)Google Scholar
  5. 5.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Kagawa, S., Okamoto, S., Suh, S., Kondo, Y., Nansai, K.: Finding environmentally important industry clusters: multiway cut approach using nonnegative matrix factorization. Soc. Netw. 35(3), 423–438 (2013)CrossRefGoogle Scholar
  7. 7.
    Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)CrossRefGoogle Scholar
  8. 8.
    Newman, M.E.J.: Spectral methods for community detection and graph partitioning. Phys. Rev. E 88, 042822 (2013)CrossRefGoogle Scholar
  9. 9.
    Okubo, M., Hanaka, T., Ono, H.: Optimal partition of a tree with social distance. CoRR abs/1809.03392 (2018)Google Scholar
  10. 10.
    Porschen, S., Schmidt, T., Speckenmeyer, E., Wotzlaw, A.: XSAT and NAE-SAT of linear CNF classes. Discrete Appl. Math. 167, 1–14 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. Artif. Intell. 229, 139–174 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27–64 (2007)CrossRefGoogle Scholar
  13. 13.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)CrossRefGoogle Scholar
  14. 14.
    Sless, L., Hazon, N., Kraus, S., Wooldridge, M.: Forming \(k\) coalitions and facilitating relationships in social networks. Artif. Intell. 259, 217–245 (2018)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Graduate School of InformaticsNagoya UniversityNagoyaJapan
  2. 2.Department of Information and System EngineeringChuo UniversityTokyoJapan

Personalised recommendations