{"@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/Q286157","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q286157","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q286157","kernelVersion":"v1","immutable":true,"modified":"2026-01-22T21:57:31Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q286157","name":"On graph combinatorics to improve eigenvector-based measures of centrality in directed networks","headline":"On graph combinatorics to improve eigenvector-based measures of centrality in directed networks","description":"scientific article; zbMATH DE number 6583109","url":"https://portal.mardi4nfdi.de/entity/Q286157","datePublished":"2016-05-20","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1401217"},{"@id":"https://portal.mardi4nfdi.de/entity/Q996322"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q92813"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.LAA.2016.04.011","url":"https://doi.org/10.1016/J.LAA.2016.04.011"},"sameAs":["https://doi.org/10.1016/J.LAA.2016.04.011"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2651280"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5491464"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1380010"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5900896"}]},"provenance":{"prov:generatedAtTime":"2026-01-22T21:57:31Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}