The Densest k Subgraph Problem in b-Outerplanar Graphs
Data Structures and Algorithms
2019-07-10 v1
Abstract
We give an exact algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact 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.
Cite
@article{arxiv.1907.03863,
title = {The Densest k Subgraph Problem in b-Outerplanar Graphs},
author = {Sean Gonzales and Theresa Migler},
journal= {arXiv preprint arXiv:1907.03863},
year = {2019}
}