{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2808534","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2808534","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2808534","kernelVersion":"v1","immutable":true,"modified":"2025-05-26T15:48:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2808534","name":"The complexity of deciding whether a graph admits an orientation with fixed weak diameter","headline":"The complexity of deciding whether a graph admits an orientation with fixed weak diameter","description":"scientific article; zbMATH DE number 6584108","url":"https://portal.mardi4nfdi.de/entity/Q2808534","datePublished":"2016-05-24","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q244929"},{"@id":"https://portal.mardi4nfdi.de/entity/Q727198"},{"@id":"https://portal.mardi4nfdi.de/entity/Q724886"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q6599785"}]},"provenance":{"prov:generatedAtTime":"2025-05-26T15:48:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}