Extremal Functions for Shortening Sets of Paths

DOI10.1017/S0963548306007784MaRDI QIDQ3419769zbMATH OpenFDO

Authors Paul Wollan

Publication date 7 February 2007

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548306007784

zbMATH Keywords

vertex-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 568796
• scientific article; zbMATH DE number 3871984
• scientific article; zbMATH DE number 3105908
• On Shortest Paths in Polyhedral Spaces
• scientific article; zbMATH DE number 815069
• Computing almost shortest paths (extended abstract)
• Approximating Shortest Paths in Graphs
• scientific article; zbMATH DE number 1305474
• An extremal function for contractions of graphs
• scientific article; zbMATH DE number 4112412

This page was built for publication: Extremal Functions for Shortening Sets of Paths

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