Efficient algorithms for combinatorial problems on graphs...

Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

Stefan Arnborg
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
25
Year:
1985
Language:
english
Pages:
23
Journal:
BIT Numerical Mathematics
DOI:
10.1007/bf01934985
File:
PDF, 1.45 MB
english, 1985
Conversion to is in progress
Conversion to is failed