The Fast Algorithm for the Between Centrality

Research Project

Project/Area Number	22500035
Research Category	Grant-in-Aid for Scientific Research (C)
Allocation Type	Single-year Grants
Section	一般
Research Field	Software
Research Institution	Nihon University
Principal Investigator	KURINO Shun-ichi 日本大学, 理工学部, 専任講師 (30215066)
Project Period (FY)	2010 – 2012
Project Status	Completed (Fiscal Year 2012)
Budget Amount *help	¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000) Fiscal Year 2012: ¥130,000 (Direct Cost: ¥100,000、Indirect Cost: ¥30,000) Fiscal Year 2011: ¥130,000 (Direct Cost: ¥100,000、Indirect Cost: ¥30,000) Fiscal Year 2010: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
Keywords	アルゴリズム / 情報基礎 / 最短経路 / 極大平面グラフ / 媒介中心性 / 最短経路問題 / n次元格子
Research Abstract	The purpose of this research was development of a fast algorithm for the between centrality in simple graph. By the result of this research, we found the composition possibility of the high-speed algorithm for maximal planar graph, with simple contiguity exploration method.

Report

(4 results)