Wu, Bang Ye A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. (English) Zbl 1233.68149 J. Comput. Syst. Sci. 77, No. 6, 1054-1057 (2011). MSC: 68Q25 05C38 68W25 05C85 PDFBibTeX XMLCite \textit{B. Y. Wu}, J. Comput. Syst. Sci. 77, No. 6, 1054--1057 (2011; Zbl 1233.68149) Full Text: DOI
Yu, Chih-Chiang; Lin, Chien-Hsin; Wang, Biing-Feng Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph. (English) Zbl 1213.05059 J. Comput. Syst. Sci. 76, No. 8, 697-708 (2010). MSC: 05C10 05C20 05C85 68W05 68R10 90C39 PDFBibTeX XMLCite \textit{C.-C. Yu} et al., J. Comput. Syst. Sci. 76, No. 8, 697--708 (2010; Zbl 1213.05059) Full Text: DOI
Alon, Noga; Pudlak, Pavel Superconcentrators of depths 2 and 3; odd levels help (rarely). (English) Zbl 0802.68095 J. Comput. Syst. Sci. 48, No. 1, 194-202 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{N. Alon} and \textit{P. Pudlak}, J. Comput. Syst. Sci. 48, No. 1, 194--202 (1994; Zbl 0802.68095) Full Text: DOI
Ntafos, Simeon; Gonzalez, Teofilo On the computational complexity of path cover problems. (English) Zbl 0547.68044 J. Comput. Syst. Sci. 29, 225-242 (1984). MSC: 68Q25 68R10 05C38 05C20 PDFBibTeX XMLCite \textit{S. Ntafos} and \textit{T. Gonzalez}, J. Comput. Syst. Sci. 29, 225--242 (1984; Zbl 0547.68044) Full Text: DOI
Gabber, Ofer; Galil, Zvi Explicit constructions of linear-sized superconcentrators. (English) Zbl 0487.05045 J. Comput. Syst. Sci. 22, 407-420 (1981). MSC: 05C40 94C15 PDFBibTeX XMLCite \textit{O. Gabber} and \textit{Z. Galil}, J. Comput. Syst. Sci. 22, 407--420 (1981; Zbl 0487.05045) Full Text: DOI