Abstract
We continue the study of boundary classes for NP-hard problems and focus on seven NP-hard graph problems involving non-local properties: Hamiltonian Cycle, Hamiltonian Cycle Through Specified Edge, Hamiltonian Path, Feedback Vertex Set, Connected Vertex Cover, Connected Dominating Set and GraphVCconDimension. Our main result is the determination of the first boundary class for Feedback Vertex Set. We also determine boundary classes for Hamiltonian Cycle Through Specified Edge and Hamiltonian Path and give some insights on the structure of some boundary classes for the remaining problems.
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.
