On the complexity of locally rainbow path

DOI10.1007/978-3-032-04700-7_12MaRDI QIDQ6852231zbMATH OpenFDO

Authors Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida

Publication date 26 February 2026

zbMATH Keywords

parameterized algorithmlocally rainbow pathshortest \(s\)-\(t\) path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: On the complexity of locally rainbow path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852231)