%0 Journal Article %1 journals/dmtcs/BensmailDK16 %A Bensmail, Julien %A Duvignau, Romaric %A Kirgizov, Sergey %D 2016 %J Discret. Math. Theor. Comput. Sci. %K dblp %N 3 %P 31-42 %T The complexity of deciding whether a graph admits an orientation with fixed weak diameter. %U http://dblp.uni-trier.de/db/journals/dmtcs/dmtcs17.html#BensmailDK16 %V 17

@article{journals/dmtcs/BensmailDK16, added-at = {2023-01-31T00:00:00.000+0100}, author = {Bensmail, Julien and Duvignau, Romaric and Kirgizov, Sergey}, biburl = {https://www.bibsonomy.org/bibtex/2d36fec088438c023e44e9243ccd44b95/dblp}, ee = {https://doi.org/10.46298/dmtcs.2161}, interhash = {4e589d3ab7ffcda68c02a10909a562a1}, intrahash = {d36fec088438c023e44e9243ccd44b95}, journal = {Discret. Math. Theor. Comput. Sci.}, keywords = {dblp}, number = 3, pages = {31-42}, timestamp = {2024-04-08T14:54:06.000+0200}, title = {The complexity of deciding whether a graph admits an orientation with fixed weak diameter.}, url = {http://dblp.uni-trier.de/db/journals/dmtcs/dmtcs17.html#BensmailDK16}, volume = 17, year = 2016 }