On the parameterized complexity of computing good edge-labelings

DOI10.1016/J.JCSS.2025.103752MaRDI QIDQ6859735zbMATH OpenFDO

Authors Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva

Publication date 11 February 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

treewidthparameterized complexitypolynomial kernelstructural parametersgood edge-labelings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)

This page was built for publication: On the parameterized complexity of computing good edge-labelings

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