The complexity of deciding whether a graph admits an orientation with fixed weak diameter

From MaRDI portal
Publication:2808534

zbMATH Open1336.05037MaRDI QIDQ2808534FDOQ2808534


Authors: Julien Bensmail, Romaric Duvignau, Sergey Kirgizov Edit this on Wikidata


Publication date: 24 May 2016

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2704/0.html




Recommendations





Cited In (12)





This page was built for publication: The complexity of deciding whether a graph admits an orientation with fixed weak diameter

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