Abstract
The authors present a new heuristic solution technique for the vertex cover problem. This technique is computationally efficient for very large graphs containing thousands of vertices and edges. It is based upon a general heuristic problem solving framework known as parallel dynamic interaction (PDI). A novel aspect of PDI is that it employs an inherently parallel computational structure that is easily implementable on shared memory multiprocessors of modest size. Empirical data indicate that PDI consistently outperforms other reported vertex cover heuristics, including those that require orders of magnitude greater execution time. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
