Login / Signup
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
Alessio Conte
Roberto Grossi
Mamadou Moustapha Kanté
Andrea Marino
Takeaki Uno
Kunihiro Wasa
Published in:
MFCS (2019)
Keyphrases
</>
steiner tree
minimum spanning tree
graph mining
graph databases
graph properties
subgraph matching
subgraph isomorphism
labeled graphs
spanning tree
graph theory
facility location
connected subgraphs
maximum clique
shortest path
graph structures
graph data
reachability queries
weighted graph
frequent subgraphs
undirected graph
query graph
linear programming relaxation
genetic algorithm
connected components
edge weights
data objects
traveling salesman problem
search algorithm
bayesian networks
social networks