Department of
Electronics and Informatics
This project investigates various graph families for computer network design. We are particularly interested in graph decomposition, factorization and embedding problems, and related graph algorithms. These problems are fundamental to study the efficiency and reliability of communication on computer networks. One of our recent achievements is the factorizability of directed complete graphs into de Bruijn graphs and Kautz graphs.
© GUNMA Univ. all rights reserved.
