Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs.
Yaw-Ling LinPublished in: ISAAC (1998)
Keyphrases
- computationally efficient
- graph theory
- orders of magnitude
- computationally intensive
- times faster
- computationally expensive
- machine learning
- learning algorithm
- single pass
- data sets
- efficient implementation
- worst case
- computational cost
- computational complexity
- significant improvement
- highly efficient
- web graph
- neural network