Journal of the Operations Research Society of Japan 61(1) 151-162 2018年1月 [査読有り]
This paper discusses the problem of determining whether a given plane graph is a Delaunay graph, i.e., whether it is topologically equivalent to a Delaunay triangulation. There exist theorems which characterize Delaunay graphs and yield polynomial...
Modularity proposed by Newman and Girvan is a quality function for community detection. Numerous heuristics for modularity maximization have been proposed because the problem is NP-hard. However, the accuracy of these heuristics has yet to be prop...
Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012 241-246 2012年12月
This paper discusses a problem for determining whether a given plane graph is a Delaunay graph, i.e., whether it is topologically equivalent to a Delaunay triangula- Tion. There exists a theorem which characterizes De- launay graphs and yields a p...
上智大学
理工学部