Knapsack in graph groups, HNN-extensions and amalgamated products.
Markus LohreyGeorg ZetzschePublished in: CoRR (2015)
Keyphrases
- graph representation
- random walk
- directed graph
- dynamic programming
- graph theory
- graph structure
- knapsack problem
- connected components
- structured data
- directed acyclic graph
- graph model
- weighted graph
- default logic
- upper bound
- product information
- communities in social networks
- feasible solution
- graph matching
- evolutionary algorithm
- dependency graph