On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs.
Ricardo Tavares de OliveiraFabiano SilvaPublished in: MICAI (2) (2015)
Keyphrases
- graph theoretic
- graph theory
- combinatorial optimization
- directed graph
- graph matching
- upper bound
- maximum clique
- graph representation
- multicast routing
- graph mining
- prize collecting
- series parallel
- subgraph isomorphism
- fractal image compression
- graph kernels
- encoding scheme
- undirected graph
- graph databases
- graph structure
- sat solvers
- bipartite graph