Abstract
In this paper, we give some basic notions concerning the st-connected vertex separator problem(st-CVS problem), then we give mathematical formula for st-CVS problem, then some special cases on some types of graphs, after then introduce an integer programming formulations for this problem. Also, we introduce a heuristic to solve this problem.
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.
