Exploiting c-Closure in Kernelization Algorithms for Graph Problems

From MaRDI portal

Revision as of 01:22, 24 November 2025 by Import251124011128 (talk | contribs) (Import251124011128 moved page Exploiting c-Closure in Kernelization Algorithms for Graph Problems to Exploiting c-Closure in Kernelization Algorithms for Graph Problems: Move profile page according to new naming schema. Job import251124011128)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

DOI10.4230/LIPICS.ESA.2020.65OpenAlexW3082339973MaRDI QIDQ5874537

Author name not available (Why is that?)

Publication date: 7 February 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12931/pdf/LIPIcs-ESA-2020-65.pdf/

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Exploiting c-Closure in Kernelization Algorithms for Graph Problems

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

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Exploiting_c-Closure_in_Kernelization_Algorithms_for_Graph_Problems&oldid=43523117"