Next Article in Journal
Algorithms for Non-Negatively Constrained Maximum Penalized Likelihood Reconstruction in Tomographic Imaging
Next Article in Special Issue
New Heuristics for Rooted Triplet Consistency
Previous Article in Journal / Special Issue
Computing the Eccentricity Distribution of Large Graphs
 
 

Order Article Reprints

Journal: Algorithms, 2013
Volume: 6
Number: 119

Article: A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Authors: by Tatsuya Akutsu and Takeyuki Tamura
Link: https://www.mdpi.com/1999-4893/6/1/119

MDPI offers high quality article reprints with convenient shipping to destinations worldwide. Each reprint features a 270 gsm bright white cover and 105 gsm premium white paper, bound with two stitches for durability and printed in full color. The cover design is customized to your article and designed to be complimentary to the journal.

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

Validate and Place Order

The order must be prepaid after it is placed

req denotes required fields.
Back to TopTop