54- https://doi.org/10.1007/s10589-013-9548-5
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Mar 14, 2013
- Computational Optimization and Applications
- Svyatoslav Trukhanov +3 more
Abstract
Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial , interesting property that is hereditary on induced subgraphs , is known to be NP-hard....
- # Simple Undirected Graph
- # Structures In Graphs
- # Simple Graph
- # Optimal Structures
- # Subset Of Vertices
- # Maximum Subset
- # Undirected Graph
