Maximum Pagenumber-k Subgraph is NP-Complete
Computational Complexity
2015-04-24 v2
Abstract
Given a graph with a total order defined on its vertices, the Maximum Pagenumber- Subgraph Problem asks for a maximum subgraph of such that can be embedded into a -book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for .
Keywords
Cite
@article{arxiv.1504.05908,
title = {Maximum Pagenumber-k Subgraph is NP-Complete},
author = {Peter Jonsson and Marco Kuhlmann},
journal= {arXiv preprint arXiv:1504.05908},
year = {2015}
}
Comments
6 pages, 1 figure