scientific article
From MaRDI portal
Publication:3077170
zbMath1205.05185arXivmath/0511501MaRDI QIDQ3077170
Publication date: 22 February 2011
Full work available at URL: https://arxiv.org/abs/math/0511501
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
subgroupsrouting problemNP-complete problemgenerating setCayley distanceEulerian directed graphelements of symmetric groups
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subgroups of symmetric groups (20B35)
Related Items (3)
The complexity of the weight problem for permutation and matrix groups. ⋮ On the subgroup distance problem. ⋮ Orthomorphisms of abelian groups with minimum possible pairwise distances
This page was built for publication:
