A guide to graph algorithms

DOI10.1007/978-981-16-6350-5MaRDI QIDQ5015244zbMATH OpenOpenAlexFDO

Authors Ton Kloks, Mingyu Xiao

Publication date 6 December 2021

Full work available at URL https://doi.org/10.1007/978-981-16-6350-5

zbMATH Keywords

asteroidal setsgraph algorithmsgraph coloringgraph minorsgraph productsimmersionsmodular decompositionrankwidthtournamentstreewidthtriangulations

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Exact algorithms for difficult graph problems
• Algorithms on Trees and Graphs
• scientific article; zbMATH DE number 777378
• scientific article; zbMATH DE number 1820633
• scientific article; zbMATH DE number 3906496

Cited in

(6)

• Guide to graph algorithms. Sequential, parallel and distributed
• Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques
• Algebraic graph algorithms. A practical guide using Python
• Exact algorithms for difficult graph problems
• Graphs, Algorithms, and Optimization
• Parameterized algorithms

This page was built for publication: A guide to graph algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015244)