Next Article in Journal / Special Issue
A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Previous Article in Journal / Special Issue
Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach
 
 

Order Article Reprints

Journal: Algorithms, 2013
Volume: 6
Number: 100

Article: Computing the Eccentricity Distribution of Large Graphs
Authors: by Frank W. Takes and Walter A. Kosters
Link: https://www.mdpi.com/1999-4893/6/1/100

MDPI provides article reprints in high quality with convenient shipping to destinations worldwide. The articles are printed in on premium paper with high-resolution figures. Our covers are customized to your article and designed to be complimentary to the journal. These reprints are ideal additions to your portfolio. Copy details: 135g/m2 paper, 2x stitched, full colour and glossy finish, orderable in quantities from 10 to 1000.

If you have any questions, or special requests, please write to our support team; we are happy to provide you with the information you need.

Reprint Options

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

Order Cost and 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