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 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