{"@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/Q3756517","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3756517","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3756517","kernelVersion":"v1","immutable":true,"modified":"2026-01-19T19:43:58Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3756517","name":"On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem","headline":"On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem","description":"scientific article; zbMATH DE number 4005611","url":"https://portal.mardi4nfdi.de/entity/Q3756517","datePublished":"1986-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q672726"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q84798"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/0215072","url":"https://doi.org/10.1137/0215072"},"sameAs":["https://doi.org/10.1137/0215072"]},"provenance":{"prov:generatedAtTime":"2026-01-19T19:43:58Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}