Generation of Cubic graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

Generation of Cubic graphs

Abstract

We describe a new algorithm for the efficient generation of all non-isomorphic connected cubic graphs. Our implementation of this algorithm is more than 4 times faster than previous generators. The generation can also be efficiently restricted to cubic graphs with girth at least 4 or 5.
Fichier principal
Vignette du fichier
1801-6352-1-PB.pdf (250.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990486 , version 1 (13-05-2014)

Identifiers

Cite

Gunnar Brinkmann, Jan Goedgebeur, Brendan D. Mckay. Generation of Cubic graphs. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 2 (2), pp.69--79. ⟨10.46298/dmtcs.551⟩. ⟨hal-00990486⟩

Collections

TDS-MACS
251 View
3537 Download

Altmetric

Share

Gmail Facebook X LinkedIn More