Optimal Partition of a Tree with Social Distance

Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings
EditorsGautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783030105631
Publication statusPublished - 2019
Externally publishedYes
Event13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019 - Guwahati, India
Duration: Feb 27 2019Mar 2 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11355 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimal Partition of a Tree with Social Distance'. Together they form a unique fingerprint.

Cite this