Computing paths of large rank in planar frameworks deterministically

DOI10.4230/LIPICS.ISAAC.2023.32MaRDI QIDQ6953187zbMATH OpenFDO

Authors Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis

Publication date 24 July 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

planar graphlongest pathirrelevant vertexlinear matroid

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Computing paths of large rank in planar frameworks deterministically

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