
doi: 10.46298/dmtcs.551
handle: 1854/LU-1973882 , 1885/59131
Discrete Algorithms 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.
Technology, cubic graph, Keywords: Canonical construction path, Generation, Mathematics, Applied, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], 46 Information and computing sciences, Graph, Computation Theory & Mathematics, generation, QA1-939, Cubic graph, 01 Mathematical Sciences, canonical construction path, Science & Technology, Algorithms Canonical construction path, graph, Science General, Computer Science, Software Engineering, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Physical Sciences, Computer Science, 08 Information and Computing Sciences, 49 Mathematical sciences, Mathematics
Technology, cubic graph, Keywords: Canonical construction path, Generation, Mathematics, Applied, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], 46 Information and computing sciences, Graph, Computation Theory & Mathematics, generation, QA1-939, Cubic graph, 01 Mathematical Sciences, canonical construction path, Science & Technology, Algorithms Canonical construction path, graph, Science General, Computer Science, Software Engineering, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Physical Sciences, Computer Science, 08 Information and Computing Sciences, 49 Mathematical sciences, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
