Order Reprints

Journal: Algorithms, 2013
Volume: 6
Page(s): 119-135

Article: A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Akutsu, T.; Tamura, T.

http://www.mdpi.com/1999-4893/6/1/119

Reprint Options
If you need more than 1000 copies, please contact us by e-mail (reprints@mdpi.com) and we will prepare an individual offer for you.

Contact Person
Shippment Address
Order cost and details
Notes or Comments
Validate and Submit Form
Captcha Can't read?
req denotes required fields.