4 citations · 7 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck +1
Preferential attachment lies at the heart of many network models aiming to replicate features of real world networks. To simulate the attachment process, conduct statistical tests,…
cs.DS2022
Certifying Induced Subgraphs in Large Graphs
Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
We introduce I/O-optimal certifying algorithms for bipartite graphs, as well as for the classes of split, threshold, bipartite chain, and trivially perfect graphs. When the input g…