Structural Information and Communication Complexity
From MaRDI portal
Publication:5710097
DOI10.1007/b136628zbMath1085.68597OpenAlexW2480963397MaRDI QIDQ5710097
Paola Vocca, Tiziana Calamoneri
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136628
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) Approximation algorithms (68W25)
Related Items (3)
Group path covering and distance two labeling of graphs ⋮ \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle ⋮ Radio number for the product of a path and a complete graph
Uses Software
This page was built for publication: Structural Information and Communication Complexity