Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.
Henning FernauDaniel RaiblePublished in: WALCOM (2008)
Keyphrases
- exact algorithms
- np hard
- approximation algorithms
- knapsack problem
- graph databases
- graph mining
- subgraph matching
- subgraph isomorphism
- graph classification
- labeled graphs
- graph properties
- planar graphs
- graph data
- exact solution
- combinatorial optimization
- dense subgraphs
- connected subgraphs
- vehicle routing problem with time windows
- benders decomposition
- undirected graph
- combinatorial problems
- graph matching
- lower bound
- heuristic methods
- connected graphs
- frequent subgraphs
- np complete
- query graph
- combinatorial optimization problems
- neural network
- optimal solution
- max sat
- graph model
- weighted graph
- branch and bound algorithm
- directed graph
- special case
- edge weights
- bipartite graph
- vehicle routing problem
- pattern mining