{"@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/Q3132885","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3132885","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3132885","kernelVersion":"v1","immutable":true,"modified":"2026-01-24T00:39:02Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3132885","name":"On the complexity of minimum-link path problems","headline":"On the complexity of minimum-link path problems","description":"scientific article; zbMATH DE number 6832306","url":"https://portal.mardi4nfdi.de/entity/Q3132885","datePublished":"2018-01-30","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q489758"},{"@id":"https://portal.mardi4nfdi.de/entity/Q293617"},{"@id":"https://portal.mardi4nfdi.de/entity/Q390126"},{"@id":"https://portal.mardi4nfdi.de/entity/Q832912"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.4230/LIPICS.SOCG.2016.49","url":"https://doi.org/10.4230/LIPICS.SOCG.2016.49"},"sameAs":["https://doi.org/10.4230/LIPICS.SOCG.2016.49"]},"provenance":{"prov:generatedAtTime":"2026-01-24T00:39:02Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}