The following pages link to (Q3416074):
Displaying 12 items.
- Computing role assignments of split graphs (Q287443) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Computational complexity of covering disconnected multigraphs (Q2140489) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks (Q3408165) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
