Faster Parameterized Algorithms for Deletion to Split Graphs.
Esha GhoshSudeshna KolayMrinal KumarPranabendu MisraFahad PanolanAshutosh RaiM. S. RamanujanPublished in: SWAT (2012)
Keyphrases
- graph theory
- learning algorithm
- data structure
- computational complexity
- computational cost
- machine learning
- computationally demanding
- computationally efficient
- theoretical analysis
- times faster
- maximum cardinality
- random graphs
- graph data
- graph theoretic
- directed graph
- combinatorial optimization
- computational efficiency
- orders of magnitude
- significant improvement
- lower bound
- decision trees