Generating regular directed graphs (Q1759803)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating regular directed graphs |
scientific article; zbMATH DE number 6109885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating regular directed graphs |
scientific article; zbMATH DE number 6109885 |
Statements
Generating regular directed graphs (English)
0 references
22 November 2012
0 references
The main result of this article is an efficient algorithm for generating all regular directed graph with given number of vertices and given degree. Directed graphs are constructed from regular bipartite (i.e., undirected) graphs.
0 references
directed graph
0 references
canonical construction path
0 references
bipartite
0 references
structure generation
0 references
0.8087798357009888
0 references
0.8072369694709778
0 references
0.7859150171279907
0 references
0.7837713360786438
0 references
0.7721084356307983
0 references
