A Unified Approach for Treewidth and Minimum Fill-in Problems on Bipartite Permutation Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 90 === A graph is chordal if every cycle of length greater than three has a chord. The treewidth (respectively, minimum ll-in) problem is to nd a chordal supergraph with the smallest possible maximum clique size (respectively, the minimum number of additional edges). S...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48153624534081967324 |