scientific article
From MaRDI portal
Publication:3416074
zbMath1106.68043MaRDI QIDQ3416074
Wiesław Zielonka, Jérémie Chalopin, Yves Métivier
Publication date: 19 January 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Computing role assignments of split graphs ⋮ Computational complexity of covering disconnected multigraphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Comparing Universal Covers in Polynomial Time ⋮ Computing role assignments of proper interval graphs in polynomial time ⋮ Labelled (Hyper)Graphs, Negotiations and the Naming Problem ⋮ On the power of synchronization between two adjacent processes ⋮ Computing Role Assignments of Proper Interval Graphs in Polynomial Time ⋮ Computing role assignments of chordal graphs ⋮ Comparing universal covers in polynomial time ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
This page was built for publication:
