Computer Science
5 years ago

New algorithm revolutionizes solving Minimum Vertex Cover problem in neighborhoods!

1 view
arXiv (Cornell University)
Neighbourhood Evaluation Criteria for Vertex Cover Problem.
Kaustubh K. Joshi

Paper Summary

Neighbourhood Evaluation Criteria is an algorithm that helps find the smallest set of points in a network that covers all connections. It looks at the number of connections each point has and picks the one with the most connections. If there are ties, it chooses the point with the least influence on its neighbors. If there are still ties, it picks the point that leaves the fewest other points uncovered.

Related papers

Theme background image
Engineering
3 years ago

New algorithm revolutionizes optimal placement in transitive oriented graphs!

FPGA Design
Cutting Optimization
Graph Theory
Theme background image
Computer Science
6 years ago

New algorithm cuts travel time in half on Delaunay Triangulation!

Mesh Generation
Trajectory Analysis
Geographic Information
Theme background image
Computer Science
8 years ago

New algorithms revolutionize efficient network optimization in location-aware unit disk graphs!

Trajectory Analysis
Mesh Generation
Combinatorial Optimization