FPT algorithms to recognize well covered graphs.

Rafael T. Araújo Sulamita Klein Rudini Menezes Sampaio Uéverton S. Souza

Published in: CoRR (2018)

Keyphrases

graph theory
learning algorithm
computational cost
computationally efficient
data streams
computational complexity
theoretical analysis
times faster
data mining
feature selection
data structure
lower bound
np complete
orders of magnitude
graph theoretic
planar graphs