Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three
From MaRDI portal
Publication:1627193
DOI10.1007/978-3-030-00256-5_30OpenAlexW2889469624MaRDI QIDQ1627193
Publication date: 22 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-00256-5_30
Related Items (2)
Hardness and efficiency on minimizing maximum distances in spanning trees ⋮ Hardness and efficiency on \(t\)-admissibility for graph operations
This page was built for publication: Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three
