{"@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/Q4210165","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4210165","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4210165","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T02:38:04Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4210165","name":"Optimal Construction of Edge-Disjoint Paths in Random Graphs","headline":"Optimal Construction of Edge-Disjoint Paths in Random Graphs","description":"scientific article; zbMATH DE number 1200804","url":"https://portal.mardi4nfdi.de/entity/Q4210165","datePublished":"1998-09-21","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q671934"},{"@id":"https://portal.mardi4nfdi.de/entity/Q426755"},{"@id":"https://portal.mardi4nfdi.de/entity/Q477097"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1577015"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q84798"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/S0097539795290805","url":"https://doi.org/10.1137/S0097539795290805"},"sameAs":["https://doi.org/10.1137/S0097539795290805"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1150630"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4312418"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4074927"},{"@id":"https://portal.mardi4nfdi.de/entity/Q770930"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4015475"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4234048"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3833622"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1892832"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1117955"}]},"provenance":{"prov:generatedAtTime":"2025-12-25T02:38:04Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}