{"@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/Q477694","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q477694","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q477694","kernelVersion":"v1","immutable":true,"modified":"2025-07-02T16:59:11Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q477694","name":"On finding the longest antisymmetric path in directed acyclic graphs","headline":"On finding the longest antisymmetric path in directed acyclic graphs","description":"scientific article; zbMATH DE number 6378689","url":"https://portal.mardi4nfdi.de/entity/Q477694","datePublished":"2014-12-09","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q411222"},{"@id":"https://portal.mardi4nfdi.de/entity/Q477693"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.IPL.2014.10.014","url":"https://doi.org/10.1016/J.IPL.2014.10.014"},"sameAs":["https://doi.org/10.1016/J.IPL.2014.10.014"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3580971"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3579199"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1213733"},{"@id":"https://portal.mardi4nfdi.de/entity/Q967328"},{"@id":"https://portal.mardi4nfdi.de/entity/Q839675"},{"@id":"https://portal.mardi4nfdi.de/entity/Q411223"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4527015"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1838316"}]},"provenance":{"prov:generatedAtTime":"2025-07-02T16:59:11Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}