Presentation 1995/12/22
A Proposal of Algorithm for Comprehensive Arrangement on Undirected Graph and its Application in Education
Hiroki Hanawa, Kanji Akahori,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this research, we discussed the problem of comprehensive arrangement on undirected graph. A information often represented in a matrix in education. However, it is difficult to comprehend the many information in a large matrix. Therefore, we exchanged a matrix into graph using nodes and links. In first, we simulated the comprehensive arrangement using simple genetic algorithm and, obtained a effective result in the about 10 nodes. We proposed the exploring algorithm for much more 10 nodes. The results of simulation by this algorithm presented a effective comprehensive arrangement.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) undirected graph / adjacency matrix / combinatorial optimization problem / educational technology / genetic algorithm
Paper # ET95-93
Date of Issue

Conference Information
Committee ET
Conference Date 1995/12/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Educational Technology (ET)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Proposal of Algorithm for Comprehensive Arrangement on Undirected Graph and its Application in Education
Sub Title (in English)
Keyword(1) undirected graph
Keyword(2) adjacency matrix
Keyword(3) combinatorial optimization problem
Keyword(4) educational technology
Keyword(5) genetic algorithm
1st Author's Name Hiroki Hanawa
1st Author's Affiliation Tokyo Institute of Technology()
2nd Author's Name Kanji Akahori
2nd Author's Affiliation Tokyo Institute of Technology
Date 1995/12/22
Paper # ET95-93
Volume (vol) vol.95
Number (no) 447
Page pp.pp.-
#Pages 8
Date of Issue