{"@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/Q2294271","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2294271","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2294271","kernelVersion":"v1","immutable":true,"modified":"2026-04-02T18:40:06Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2294271","name":"The undirected two disjoint shortest paths problem","headline":"The undirected two disjoint shortest paths problem","description":"scientific article; zbMATH DE number 7165754","url":"https://portal.mardi4nfdi.de/entity/Q2294271","datePublished":"2020-02-10","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q724948"},{"@id":"https://portal.mardi4nfdi.de/entity/Q978784"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2294270"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96289"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.ORL.2018.11.011","url":"https://doi.org/10.1016/J.ORL.2018.11.011"},"sameAs":["https://doi.org/10.1016/J.ORL.2018.11.011"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5111698"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5167743"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1392552"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4132234"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3237973"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1132111"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4087195"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1892832"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4060767"}]},"provenance":{"prov:generatedAtTime":"2026-04-02T18:40:06Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}