On the pathwidth of almost semicomplete digraphs.

Kenta Kitsunai Yasuaki Kobayashi Hisao Tamaki

Published in: CoRR (2015)

Keyphrases

equivalence classes
directed graph
bounded treewidth
markov models
np complete
machine learning
social networks
similarity measure
objective function
query processing
color images
active learning
np hard
information extraction