Theoretical Computer Science
From MaRDI portal
Publication:5395075
DOI10.1007/11560586zbMath1171.68612OpenAlexW2603408665MaRDI QIDQ5395075
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11560586
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ The \(L(d,1)\)-number of powers of paths ⋮ Labeling bipartite permutation graphs with a condition at distance two
This page was built for publication: Theoretical Computer Science
