Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binary tree representation and related algorithms for generating integer partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Listing Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Obtain the Complete List of Caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Generation of Trees with Specified Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4522102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of plane trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of triconnected plane triangulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating trees with<i>n</i>nodes and<i>m</i>leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating rooted and free plane trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Free Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Trees and Other Combinatorial Objects Lexicographically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for genegrating integer partitions / rank
 
Normal rank

Latest revision as of 02:40, 29 June 2024

scientific article
Language Label Description Also known as
English
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
scientific article

    Statements

    Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (English)
    0 references
    0 references
    0 references
    0 references
    24 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph
    0 references
    algorithm
    0 references
    ordered tree
    0 references
    enumeration
    0 references
    family tree
    0 references
    0 references