Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
Stefan ArnborgVolume:
25
Year:
1985
Language:
english
Pages:
23
Journal:
BIT Numerical Mathematics
DOI:
10.1007/bf01934985
File:
PDF, 1.45 MB
english, 1985