10 citations · 24 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem
Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara +2
The Balanced Connected Subgraph problem (BCS) was recently introduced by Bhore et al. (CALDAM 2019). In this problem, we are given a graph whose vertices are colored by red or…
cs.DS2017
Improved Methods for Computing Distances between Unordered Trees Using Integer Programming
Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
Kondo et al. (DS 2014) proposed methods for computing distances between unordered rooted trees by transforming an instance of the distance computing problem into an instance of the…