Titlebook: Combinatorial Optimization and Applications; 4th International Co Weili Wu,Ovidiu Daescu Conference proceedings 2010 Springer Berlin Heidel

能量守恒

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem,length is minimum among all .-paths of lengths strictly larger than the shortest path length. In this paper we give an .(|.|log|.| + |.|) time algorithm for this problem, which improves the previous result of .(|.|.) time for sparse graphs.

COLIC

不足的东西

pulse-pressure

母猪