Login / Signup
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
Iyad A. Kanj
Christian Komusiewicz
Manuel Sorge
Erik Jan van Leeuwen
Published in:
J. Comput. Syst. Sci. (2018)
Keyphrases
</>
graph theory
data structure
computational complexity
benchmark datasets
optimization problems
orders of magnitude
recently developed
data mining
social networks
decision trees
significant improvement
computationally efficient
theoretical analysis
times faster
graph theoretic