https://github.com/algebraicjulia/csetautomorphisms.jl

Automorphism groups for CSets - generalizing the nauty algorithm to a broad class of data structures

https://github.com/algebraicjulia/csetautomorphisms.jl

Science Score: 23.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • CITATION.cff file
  • codemeta.json file
    Found codemeta.json file
  • .zenodo.json file
  • DOI references
  • Academic publication links
    Links to: arxiv.org
  • Academic email domains
  • Institutional organization owner
  • JOSS paper metadata
  • Scientific vocabulary similarity
    Low similarity (8.4%) to scientific vocabulary
Last synced: 10 months ago · JSON representation

Repository

Automorphism groups for CSets - generalizing the nauty algorithm to a broad class of data structures

Basic Info
  • Host: GitHub
  • Owner: AlgebraicJulia
  • License: mit
  • Language: Julia
  • Default Branch: main
  • Size: 2.21 MB
Statistics
  • Stars: 14
  • Watchers: 9
  • Forks: 2
  • Open Issues: 5
  • Releases: 0
Created almost 5 years ago · Last pushed over 2 years ago
Metadata Files
Readme License

README.md

CSetAutomorphisms.jl CSetAutomorphisms.jl Documentation Tests

Attributed C-sets encompass a broad class of data structures, including many generalizations of graphs (e.g. directed, symmetric, reflexive), tabular data (e.g. data frames), and combinations of the two (e.g. weighted graphs, relational databases). This repo generalizes the Nauty algorithm, which produces canonical members of an isomorphism class, to cover any data structure encompassed by C-Sets. Furthermore, we compute and represent orbits and full automorphism groups of a C-Set, which can be applied to solving certain problems (e.g. searching for homomorphisms from A to B, up to isomorphism).

More background is found in the documentation or this blog post.

To do

  • The recently-released CompTime.jl will make it feasible to reimplement the core algorithm using code custom generated for a given C-Set, offering new opportunities for performance improvements.
  • For now, it is recommended to just use NautyInterface which reduces a C-Set automorphism problem to an undirected simple graph automorphism problem, which is fed to nauty.c.

Owner

  • Name: AlgebraicJulia
  • Login: AlgebraicJulia
  • Kind: organization

GitHub Events

Total
  • Watch event: 2
Last Year
  • Watch event: 2

Issues and Pull Requests

Last synced: 11 months ago

All Time
  • Total issues: 21
  • Total pull requests: 26
  • Average time to close issues: 26 days
  • Average time to close pull requests: about 9 hours
  • Total issue authors: 3
  • Total pull request authors: 3
  • Average comments per issue: 1.29
  • Average comments per pull request: 0.19
  • Merged pull requests: 24
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Top Authors
Issue Authors
  • kris-brown (12)
  • lcnbr (1)
  • JuliaTagBot (1)
Pull Request Authors
  • kris-brown (14)
  • mehalter (1)
  • epatters (1)
Top Labels
Issue Labels
enhancement (5) bug (1) documentation (1) good first issue (1)
Pull Request Labels

Dependencies

.github/workflows/TagBot.yml actions
  • JuliaRegistries/TagBot v1 composite
.github/workflows/docs.yml actions
  • actions/checkout v2 composite
  • julia-actions/setup-julia latest composite
.github/workflows/test.yaml actions
  • actions/checkout v2 composite
  • julia-actions/julia-buildpkg master composite
  • julia-actions/julia-runtest master composite
  • julia-actions/setup-julia latest composite