A Polynomial-Time Algorithm for Computing the Maximum...

Algorithms 2013 / 02 Vol. 6; Iss. 1

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

Akutsu, Tatsuya, Tamura, Takeyuki
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:
6
Language:
english
Journal:
Algorithms
DOI:
10.3390/a6010119
Date:
February, 2013
File:
PDF, 200 KB
english, 2013
Conversion to is in progress
Conversion to is failed