Generating regular directed graphs-Reference-Cited by-同舟云学术

Generating regular directed graphs

Published:2013-01 Issue:1 Volume:313 Page:1-7
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Brinkmann Gunnar

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference7 articles.

1. Uniform sampling of digraphs with a fixed degree sequence;Berger,2010

2. Isomorphism rejection in structure generation programs;Brinkmann,2000

3. Generating water clusters and other directed graphs;Brinkmann;Journal of Mathematical Chemistry,2009

4. B.D. McKay, Nauty user’s guide (version 1.5), Technical Report TR-CS-90-02, Australian National University, Department of Computer Science, 1990. http://cs.anu.edu.au/~bdm/nauty.

5. Isomorph-free exhaustive generation;McKay;Journal of Algorithms,1998

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ReHoGCNES-MDA: prediction of miRNA-disease associations using homogenous graph convolutional networks based on regular graph with random edge sampler;Briefings in Bioinformatics;2024-01-22

2. An information-theoretic approach to study spatial dependencies in small datasets;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2020-10

3. About an Approach for Constructing Combinatorial Objects;Cybernetics and Information Technologies;2018-05-01

4. Directed strongly walk-regular graphs;Journal of Algebraic Combinatorics;2017-09-11

5. Rock-Paper-Scissors Meets Borromean Rings;The Mathematical Intelligencer;2014-12-25