scientific article; zbMATH DE number 1088188
From MaRDI portal
Publication:4364501
zbMath0884.68098MaRDI QIDQ4364501
Publication date: 17 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Compressed Tree Canonization ⋮ New invariants for the graph isomorphism problem ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ The parallel complexity of graph canonization under abelian group action ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Completeness results for graph isomorphism. ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Sorting and ranking of self-delimiting numbers with applications to tree isomorphism ⋮ The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics ⋮ The Space Complexity of k-Tree Isomorphism ⋮ Partially commutative inverse monoids. ⋮ Unnamed Item ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
This page was built for publication:
