Presentation 2009-11-27
ILP Formulation of Graph Embedding and Its Application to LSI Routing
Keisuke INOUE, Mineo KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes an integer linear programming (ILP) formulation of the graph embedding problem, which outputs an optimal solution for any pair of guest and host graph. The proposed ILP provides us with a new design style to obtain a desired graph embedding under a variety of metric functions. This paper shows experimental results for several pairs of guest and host graphs, and also shows an ILP formulation of the multi-terminal routing problem in LSI (Large Scale Integration) design as an application of ILP-based graph embedding.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Graph embedding / Integer Linear Programming (ILP) / Multi-terminal routing
Paper # CAS2009-56,CST2009-29
Date of Issue

Conference Information
Committee CST
Conference Date 2009/11/19(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 Concurrent System Technology (CST)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) ILP Formulation of Graph Embedding and Its Application to LSI Routing
Sub Title (in English)
Keyword(1) Graph embedding
Keyword(2) Integer Linear Programming (ILP)
Keyword(3) Multi-terminal routing
1st Author's Name Keisuke INOUE
1st Author's Affiliation School of Information Science, Japan Advanced Institute of Science and Technology (JAIST):Japan Society for the Promotion of Science (JSPS)()
2nd Author's Name Mineo KANEKO
2nd Author's Affiliation School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)
Date 2009-11-27
Paper # CAS2009-56,CST2009-29
Volume (vol) vol.109
Number (no) 301
Page pp.pp.-
#Pages 6
Date of Issue