A branch&cut algorithm for the maximum common edge...

Electronic Notes in Discrete Mathematics 2009 Vol. 35; Iss. none

A branch&cut algorithm for the maximum common edge subgraph problem

G. Manić, Laura Bahiense, Cid de Souza
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:
35
Year:
2009
Language:
english
Pages:
6
DOI:
10.1016/j.endm.2009.11.009
File:
PDF, 202 KB
english, 2009
Conversion to is in progress
Conversion to is failed