A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.

Robert Ganian Petr Hlinený Jan Obdrzálek

Published in: Eur. J. Comb. (2013)

Keyphrases

computational cost
orders of magnitude
significant improvement
neural network
theoretical analysis
learning algorithm
data structure
business intelligence
image segmentation
computational complexity
evolutionary algorithm
knowledge discovery
simulated annealing
graph matching