On the complexity of the Maximum Subgraph Problem

DOI10.1145/800133.804356zbMath1282.68124MaRDI QIDQ5402566

John M. Lewis

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804356

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C07: Vertex degrees

Related Items

Fixed-parameter tractability of graph modification problems for hereditary properties, Local approximations for maximum partial subgraph problem.