On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs.

Yu Yang Hongbo Liu Hua Wang Shigang Feng

Published in: Discret. Appl. Math. (2016)

Keyphrases

computational cost
data structure
computational complexity
optimization problems
theoretical analysis
graph theory
spanning tree
social networks
significant improvement
special case
benchmark datasets
tree structure
directed graph
graph theoretic
polynomial time complexity