搜索页_+undirected+path+graphs+

读者指南

远程访问

科技查新

公务邮箱

NSTL服务站

在“Springer”中，命中：139条，耗时：0.1339373 秒

1.Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

作者：Ramkumar Ramaswamy ; James B. Orlin and Nilopal Chakravarti

关键词：Sensitivity analysis ; Shortest path problem ; Bottleneck shortest path ; Maximum capacity path problem

刊名：Mathematical Programming

出版时间：March 2005

出版年：2005

2.Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

作者：Andreas Jakoby ; Till Tantau

关键词：Series ; parallel graphs ; logspace algorithms ; distance problem ; longest path problem ; bounded tree ; width ; K 4 ; minor ; free graphs

刊名：Lecture Notes in Computer Science

出版时间：2007

出版年：2007

3.On Approximating the Longest Path in a Graph