Abstract

We overview algorithmic results for classes of sparse graphs emphasizing new developments in this area. We focus on recently introduced classes of graphs with bounded expansion and nowhere-dense graphs and relate algorithmic meta-theorems for these classes of graphs to their analogues for proper minor-closed classes of graphs, classes of graphs with bounded tree-width, locally bounded tree-width and locally excluding a minor.

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 call

Disclaimer: 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.