Publication:4364501
From MaRDI portal
zbMath0884.68098MaRDI QIDQ4364501
Publication date: 17 November 1997
68R10: Graph theory (including graph drawing) in computer science
Related Items
Unnamed Item, The Space Complexity of k-Tree Isomorphism, Sorting and ranking of self-delimiting numbers with applications to tree isomorphism, The parallel complexity of graph canonization under abelian group action, Gathering of robots on anonymous grids and trees without multiplicity detection, Partially commutative inverse monoids., Completeness results for graph isomorphism., On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology, The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics, New invariants for the graph isomorphism problem, Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings, Inverse monoids: decidability and complexity of algebraic questions., Optimal Gathering of Oblivious Robots in Anonymous Graphs, Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model, Compressed Tree Canonization