Graph labelings derived from models in distributed computing: a complete complexity classification

Chalopin, J.; Paulusma, D.

doi:10.1002/net.20432

Graph labelings derived from models in distributed computing: a complete complexity classification

Chalopin, J.; Paulusma, D.

Authors

J. Chalopin

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

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

Matching cuts in graphs of high girth and H-free graphs (2023)
Conference Proceeding

Solving problems on generalized convex graphs via mim-width (2023)
Journal Article

An algorithmic framework for locally constrained homomorphisms (2023)
Journal Article

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (2023)
Journal Article

Computing Subset Vertex Covers in H-Free Graphs (2023)
Conference Proceeding

Downloadable Citations

HTML

BIB

RTF

Authors

Citation

You might also like

Downloadable Citations