{"@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/Q448969","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q448969","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q448969","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T18:07:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q448969","name":"An algorithm for finding a maximum \\(t\\)-matching excluding complete partite subgraphs","headline":"An algorithm for finding a maximum \\(t\\)-matching excluding complete partite subgraphs","description":"scientific article; zbMATH DE number 6080922","url":"https://portal.mardi4nfdi.de/entity/Q448969","datePublished":"2012-09-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q273162"},{"@id":"https://portal.mardi4nfdi.de/entity/Q448968"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q408368"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.DISOPT.2012.02.003","url":"https://doi.org/10.1016/J.DISOPT.2012.02.003"},"sameAs":["https://doi.org/10.1016/J.DISOPT.2012.02.003"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1145707"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2498740"},{"@id":"https://portal.mardi4nfdi.de/entity/Q877189"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3569807"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3094939"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1410687"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3503219"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3169039"},{"@id":"https://portal.mardi4nfdi.de/entity/Q429657"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5429256"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2519019"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T18:07:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}