Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products.
Markus LohreyGeorg ZetzschePublished in: STACS (2016)
Keyphrases
- connected components
- directed graph
- dynamic programming
- random walk
- graph structure
- graph kernels
- graph representation
- weighted graph
- market segments
- upper bound
- structured data
- graph model
- graph theory
- directed acyclic graph
- knapsack problem
- image segmentation
- cluster analysis
- graph mining
- semi supervised
- long tail
- optimal solution