The following pages link to (Q4364501):
Displayed 15 items.
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- (Q4553282) (← links)
- The Space Complexity of k-Tree Isomorphism (Q5387816) (← links)
- Sorting and ranking of self-delimiting numbers with applications to tree isomorphism (Q6182920) (← links)