Linear-time algorithms for counting independent sets in bipartite permutation graphs.

Min-Sheng Lin Chien-Min Chen

Published in: Inf. Process. Lett. (2017)

Keyphrases

worst case
times faster
optimization problems
computational complexity
upper bound
benchmark datasets
orders of magnitude
bipartite graph
graph theory
learning algorithm
feature selection
clustering algorithm
lower bound
computationally efficient
theoretical analysis
graph model