T-joins in strongly connected hypergraphs.

Gruia Calinescu

Published in: Discret. Math. Algorithms Appl. (2017)

Keyphrases

strongly connected
directed graph
query optimization
join algorithms
optimum path forest
graph theory
sql queries
undirected graph
feature space
cost model
map reduce
hypergraph model
image segmentation
data structure
np hard
query evaluation