✦ LIBER ✦

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments

✍ Scribed by Manoussakis, Y.; Tuza, Z.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles and paths in bipartite tournament

✍ R. Häggkvist; Y. Manoussakis 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 362 KB

Fast algorithms for finding Hamiltonian

✍ Jørgen Bang-Jensen; Pavol Hell 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Fast parallel algorithms for finding ham

✍ Danny Soroker 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 554 KB

On monochromatic paths and monochromatic

✍ Hortensia Galeana-Sánchez; Rocı́o Rojas-Monroy 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A linear-time algorithm for finding Hami

✍ Y. Manoussakis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Strongly polynomial algorithms for findi

✍ D. D. Lozovanu 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 406 KB