Collision-Free Routing problem with Restricted L-Path

DOI10.1007/978-3-319-94667-2_1OpenAlexW2809807306MaRDI QIDQ1670977

Jammigumpula Ajay, Sasanka Roy

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94667-2_1

zbMATH Keywords

approximation algorithmmaximum independent setcollision-freeL-graphsco-comparable graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Collision-free routing problem with restricted L-path

This page was built for publication: Collision-Free Routing problem with Restricted L-Path