Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs.
Zhongzheng TangYaxuan LiZhuo DiaoPublished in: TAMC (2024)
Keyphrases
- computational complexity
- space complexity
- memory requirements
- graph theory
- small number
- orders of magnitude
- learning algorithm
- maximum number
- times faster
- run times
- neural network
- execution times
- computational efficiency
- computational cost
- benchmark datasets
- weighted graph
- theoretical analysis
- multi class
- running times
- data structure