Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 3619943

From MaRDI portal
Publication:4182548
Jump to:navigation, search

zbMath0399.05043MaRDI QIDQ4182548

Brendan D. McKay

Publication date: 1978


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

AlgorithmAutomorphism GroupDigrahLabelling a GraphPermutation Generators


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)


Related Items

A general backtrack algorithm for the isomorphism problem of combinatorial objects, Pruning the search tree in the constructive enumeration of molecular graphs, Computing Autotopism Groups of Partial Latin Rectangles, Practical graph isomorphism. II., Permutation group algorithms based on partitions. I: Theory and algorithms, Hadamard equivalence via graph isomorphism, Classical symmetries and the quantum approximate optimization algorithm



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4182548&oldid=18015011"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 13:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki