Directed Reduction Algorithms and Decomposable Graphs

Ross D. Shachter Stig K. Andersen Kim-Leng Poh

Published in: CoRR (2013)

Keyphrases

graph theory
learning algorithm
worst case
theoretical analysis
computational complexity
significant improvement
np complete
bipartite graph
computational cost
orders of magnitude
computational efficiency
combinatorial optimization
graph matching
graph representation
graph theoretic
minimum spanning tree