α-Vertex separator is NP-hard even for 3-regular graphs.
Rudolf MüllerDorothea WagnerPublished in: Computing (1991)
Keyphrases
- np hard
- undirected graph
- directed graph
- attributed graphs
- approximation algorithms
- labeled graphs
- hamiltonian cycle
- special case
- minimum cost
- connected subgraphs
- greedy heuristic
- minimum weight
- scheduling problem
- optimal solution
- closely related
- maximum cardinality
- graph matching
- average degree
- constraint satisfaction problems
- np complete
- worst case
- graph theory
- edge weights
- remains np hard
- set cover
- np hardness
- random graphs
- graph theoretic
- integer programming
- graph databases
- greedy approximation algorithm
- lower bound
- vertex set
- maximum weight
- branch and bound algorithm
- computationally hard
- bipartite graph
- graph structure
- weighted graph
- graph model
- graph partitioning
- spanning tree
- decision problems
- graph mining
- social network analysis
- linear programming
- upper bound
- search algorithm
- neural network