Titlebook: Algorithms - ESA ‘98; 6th Annual European Gianfranco Bilardi,Giuseppe F. Italiano,Geppino Pu Conference proceedings 1998 Springer-Verlag B

打折

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failurester of the new spanning tree. Such an optimal replacement is called the .. As a natural extension, the . the problem of finding the best swap for every edge of the MDST. Given a weighted graph . = (.), where |.| = . and |.| = ., we solve the ABS problem in . time and .(. + .) space, thus improving previous bounds for . = .(..).

Heart-Attack

戏法

Truculent

意外

Analogs and Duals of the MAST Problem for Sequences and Treese prove that the sequence analog of MAST can be solved in polynomial time. The . problem restricted to inputs consisting of a collection of p-sequences (pSCS) remains .-complete, as does the analogous . problem restricted to p-trees (pSCT). We also show that both problems are hard for the parameteri

纺织品