Computational complexity of distance edge labeling

DOI10.1016/J.DAM.2017.01.007MaRDI QIDQ6827504zbMATH OpenFDO

Authors Dušan Knop, Tomáš Masařík

Publication date 27 June 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexityexponential time hypothesisline-graphsdistance labeling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: Computational complexity of distance edge labeling

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