The Densest k Subgraph Problem in b-Outerplanar Graphs
Abstract
We give an exact O(nk2) algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact O(nk2 8b) algorithm for finding the densest k subgraph in b-outerplanar graphs. Finally, we hypothesize that Baker's PTAS technique will not work for the densest k subgraph problem in planar graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.