the archive
#graph density
2 resultsmath.CO2019
Local and Union Page Numbers
Laura Merker, Torsten Ueckerdt
The paper introduces two new graph parameters, the local page number and the union page number, which relax the classic page number by focusing on per‑vertex page usage and vertex‑…
#book embeddings#page number#planar graphs#treewidth
cs.DB2019
Efficient Algorithms for Densest Subgraph Discovery
Yixiang Fang, Kaiqiang Yu, Reynold Cheng +2
The paper introduces a new approach for finding densest subgraphs by leveraging k‑core structures, providing exact and approximate algorithms that work for various density definiti…
#densest subgraph#k-core#approximation algorithms#graph density