TY  - JOUR
AU  - Arnborg, S.
PY  - 1985//
TI  - Efficient algorithms for combinatorial problems on graphs with bounded decomposability ? A survey
JO  - BIT
SP  - 2
EP  - 23
VL  - 25
ID  - Arnborg85
ER  -