J. Chalopin
Graph labelings derived from models in distributed computing: a complete complexity classification
Chalopin, J.; Paulusma, D.
Citation
Chalopin, J., & Paulusma, D. (2011). Graph labelings derived from models in distributed computing: a complete complexity classification. Networks, 58(3), 207-231. https://doi.org/10.1002/net.20432
Journal Article Type | Article |
---|---|
Publication Date | Oct 1, 2011 |
Deposit Date | Dec 6, 2011 |
Journal | Networks |
Print ISSN | 0028-3045 |
Electronic ISSN | 1097-0037 |
Publisher | Wiley |
Peer Reviewed | Peer Reviewed |
Volume | 58 |
Issue | 3 |
Pages | 207-231 |
DOI | https://doi.org/10.1002/net.20432 |
Keywords | Graph labeling, Graph homomorphism, Computational complexity, Message-passing, Local computation, Leader election, Naming. |
Public URL | https://durham-repository.worktribe.com/output/1524768 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search