Presentation 2002/6/20
Heuristic Algorithms to Construct a Planar Steiner Forest for a Terminal Representation Graph
Daisuke TAKAFUJI, Satoshi TAOKA, Toshimasa WATANABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes two heuristic algorithms MWW2 and PPM-SC to construct a planar spanning Steiner forest for a given terminal representation graph. It is shown, through comparison of experimental results in 2430 input data, that PPM-SC has higher capability than MWW2.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Terminal representation graphs / independent set problem / maximum weighted faces / extraction of planar spanning subgraphs / planar Steiner forests
Paper # CAS2002-18
Date of Issue

Conference Information
Committee CAS
Conference Date 2002/6/20(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 Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Heuristic Algorithms to Construct a Planar Steiner Forest for a Terminal Representation Graph
Sub Title (in English)
Keyword(1) Terminal representation graphs
Keyword(2) independent set problem
Keyword(3) maximum weighted faces
Keyword(4) extraction of planar spanning subgraphs
Keyword(5) planar Steiner forests
1st Author's Name Daisuke TAKAFUJI
1st Author's Affiliation Graduate School of Enginnering, Hiroshima University()
2nd Author's Name Satoshi TAOKA
2nd Author's Affiliation Graduate School of Enginnering, Hiroshima University
3rd Author's Name Toshimasa WATANABE
3rd Author's Affiliation Graduate School of Enginnering, Hiroshima University
Date 2002/6/20
Paper # CAS2002-18
Volume (vol) vol.102
Number (no) 161
Page pp.pp.-
#Pages 6
Date of Issue