2013 Fiscal Year Final Research Report
Efficient Algorithms for Partitionings, Colorings and Drawings of Graphs and their Applications
| Project/Area Number |
21500001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kwansei Gakuin University (2010-2013)
Tohoku University (2009) |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
ZHOU Xiao 東北大学, 大学院情報科学研究科, 教授 (10272022)
ITO Takehiro 東北大学, 大学院情報科学研究科, 准教授 (40431548)
UCHIZAWA Kei 山形大学, 工学部, 准教授 (90510248)
|
|---|
| Project Period (FY) |
2009-04-01 – 2014-03-31
|
| Keywords | グラフ / アルゴリズム / 分割 / 彩色 / 描画 |
|---|
| Research Abstract |
This research develops efficient algorithms for the partitioning, coloring and drawing problems of graphs, and applies them to practical problems in real world. One of the representative results is an algorithm for the fairest connected partition problem. It partitions a weighted graph G to a specified number of connected subgraphs by deleting edges from G so that the difference between the maximum sum of weights in a subgraph and the minimum one is as small as possible.
|
