nauty

graph-theoretic program NAUTY: nauty is a program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. nauty is written in a portable subset of C, and runs on a considerable number of different systems. There is a small suite of programs called gtools included in the package. For example, geng can generate non-isomorphic graphs very quickly. There are also generators for bipartite graphs, digraphs, and multigraphs.

This software is also referenced in ORMS.


References in zbMATH (referenced in 411 articles , 1 standard article )

Showing results 1 to 20 of 411.
Sorted by year (citations)

1 2 3 ... 19 20 21 next

  1. Bach, Eric; Sandlund, Bryce: Baby-step giant-step algorithms for the symmetric group (2018)
  2. Aguilar, Cesar O.; Gharesifard, Bahman: Almost equitable partitions and new necessary conditions for network controllability (2017)
  3. Berkholz, Christoph; Bonsma, Paul; Grohe, Martin: Tight lower and upper bounds for the complexity of canonical colour refinement (2017)
  4. Brandt, Felix; Harrenstein, Paul; Seedig, Hans Georg: Minimal extending sets in tournaments (2017)
  5. Brijder, Robert; Traldi, Lorenzo: Isotropic matroids. III: Connectivity (2017)
  6. Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub: Optimal-depth sorting networks (2017)
  7. Foucart, Simon; Skrzypek, Lesław: On maximal relative projection constants (2017)
  8. Machacek, John: Plurigraph coloring and scheduling problems (2017)
  9. Soicher, Leonard H.: The uniqueness of a distance-regular graph with intersection array $\32,27,8,1;1,4,27,32$ and related results$ (2017)
  10. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  11. Abdesselam, Abdelmalek; Ikenmeyer, Christian; Royle, Gordon: 16,051 formulas for Ottaviani’s invariant of cubic threefolds (2016)
  12. Adamaszek, Anna; Adamaszek, Michal; Mnich, Matthias; Schmidt, Jens M.: Lower bounds for locally highly connected graphs (2016)
  13. Altinakar, Sivan; Caporossi, Gilles; Hertz, Alain: A comparison of integer and constraint programming models for the deficiency problem (2016)
  14. Bonin, Joseph E.; Savitsky, Thomas J.: An infinite family of excluded minors for strong base-orderability (2016)
  15. Buskens, Vincent; Snijders, Chris: Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study (2016)
  16. Cabello, Adán; Kleinmann, Matthias; Portillo, José R.: Quantum state-independent contextuality requires 13 rays (2016)
  17. Cheng, Xi-Ming; Gavrilyuk, Alexander L.; Greaves, Gary R.W.; Koolen, Jack H.: Biregular graphs with three eigenvalues (2016)
  18. Codish, Michael; Frank, Michael; Itzhakov, Avraham; Miller, Alice: Computing the Ramsey number $R(4,3,3)$ using abstraction and symmetry breaking (2016)
  19. Demirkale, Fatih; Donovan, Diane M.; Küçükçifçi, Selda; Yazıcı, Emine Şule: Orthogonal trades and the intersection problem for orthogonal arrays (2016)
  20. Egan, Judith; Wanless, Ian M.: Enumeration of MOLS of small order (2016)

1 2 3 ... 19 20 21 next