Minimum eccentricity shortest paths in some structured graph classes

DOI10.7155/JGAA.00394MaRDI QIDQ2807326zbMATH OpenOpenAlexFDO

Authors Feodor F. Dragan, Arne Leitert

Publication date 20 May 2016

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00394

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Minimum eccentricity shortest paths in some structured graph classes
• Minimum eccentricity shortest path problem with respect to structural parameters
• On the minimum eccentricity shortest path problem
• On the minimum eccentricity shortest path problem
• Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem

Cited in

(10)

• Path eccentricity of graphs
• On the minimum eccentricity shortest path problem
• Decomposing a graph into shortest paths with bounded eccentricity
• Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
• Minimum eccentricity shortest path problem with respect to structural parameters
• Minimum eccentricity shortest path problem with respect to structural parameters
• Decomposing a graph into shortest paths with bounded eccentricity
• Pathlength of outerplanar graphs
• On the minimum eccentricity shortest path problem
• Minimum eccentricity shortest paths in some structured graph classes

This page was built for publication: Minimum eccentricity shortest paths in some structured graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807326)