A Linear-Time Algorithm for the Pathwidth Problem on Series-Parallel Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 93 === An interval graph has a representation which is a family of intervals assigned to the vertices so that vertices are adjacent if and only if the corresponding intervals intersect. For a given graph G, the pathwidth problem is to find an interval graph containing G...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/43215238295871054170 |