One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1007/bf02679452
Copy DOI
Export
Save
Share
Cite Journal: Theory of Computing Systems |  Publication Date: Feb 1, 1997 |
 Citations: 1 |
In this paper we present a new type of graph decomposition calleda cut-cover that combines the notions of graph separators andt-neighborhood covers. We show that graphs with good cut-covers can be emulated in hypercubes and we show that planar and certain minor-excluded graphs have good cut-covers.
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.
