On the parameterized complexity of colorful components and related problems

DOI10.1007/978-3-319-94667-2_20OpenAlexW2811296076MaRDI QIDQ1671006

Neeldhara Misra

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94667-2_20

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items

Colourful components in \(k\)-caterpillars and planar graphs, Finding a Small Number of Colourful Components