2012 Fiscal Year Final Research Report
The Fast Algorithm for the Between Centrality
| 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 |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Keywords | アルゴリズム / 情報基礎 / 最短経路 / 極大平面グラフ |
|---|
| 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.
|
