Skip to main content
Conference Proceedings

The approximation of maximum subgraph problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 700 LNCS 40-51
DOI: 10.1007/3-540-56939-1_60
128Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the following class of problems: given a graph, find the maximum number of nodes inducing a subgraph that satisfies a desired property π, such as planar, acyclic, bipartite, etc. We show that this problem is hard to approximate for any property π on directed or undirected graphs that is nontrivial and hereditary on induced subgraphs.

Cite

CITATION STYLE

APA

Lund, C., & Yannakakis, M. (1993). The approximation of maximum subgraph problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 40–51). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free