Finding Branch-Decompositions and Rank-Decompositions
We present a new algorithm that can output the rank-decomposition of width at most $k$ of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most $k$ if such exists. This algorithm works...
Saved in:
| Published in: | SIAM journal on computing Vol. 38; no. 3; pp. 1012 - 1032 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2008
|
| Subjects: | |
| ISSN: | 0097-5397, 1095-7111 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!