Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
The Computer Journal
Article . 2002 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.1093/com...
Article
Data sources: Microsoft Academic Graph
 View all 2 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Loopless Generation of Trees with Specified Degrees

Loopless generation of trees with specified degrees
descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 2002 English Publisher:Oxford University Press (OUP)Journal:The Computer Journal, volume 45, pages 364-372 (issn: 0010-4620, eissn: 1460-2067, Copyright policy )
Authors: Korsh, James F.; LaFollette, Paul;

doi: 10.1093/comjnl/45.3.364

Loopless Generation of Trees with Specified Degrees

Abstract

Summary: An ordered tree with specified degrees and \(n\) nodes has \(a_i\) nodes of degree \(i\) where \(a_0= 1+ \sum_{i=1,h}(i- 1) a_i\) and \(n= \sum_{i= 0,h}a_i\). This paper presents a new and simpler loopless algorithm for generating all ordered trees with specified degrees. When \(a_k= N\), \(a_0= (k-1)N+ 1\) and all other \(a_i\)'s are \(0\), then all \(N\) node \(k\)-ary trees are generated.

Keywords

loopless algorithm, Graph theory (including graph drawing) in computer science

  • BIP!
    Impact byBIP!
    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).
    		 5
    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).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
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).
BIP!Citations provided by BIP!
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.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now