Exact O(nk^2) algorithm for densest k-subgraph in outerplanar graphs, extended to O(nk^2 8^b) for b-outerplanar graphs.
Reachability and dis- tance queries via 2-hop labels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Densest k Subgraph Problem in b-Outerplanar Graphs
Exact O(nk^2) algorithm for densest k-subgraph in outerplanar graphs, extended to O(nk^2 8^b) for b-outerplanar graphs.