Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs.

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

Keyphrases

graph theory
times faster
data structure
theoretical analysis
machine learning
orders of magnitude
computationally efficient
computational cost
learning algorithm
worst case
computational complexity
benchmark datasets
social networks
combinatorial optimization
data sets
graph embedding
max cut