Memory-efficient enumeration of constrained spanning trees (Q294700): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6594058 / rank
 
Normal rank
Property / zbMATH Keywords
 
enumeration
Property / zbMATH Keywords: enumeration / rank
 
Normal rank
Property / zbMATH Keywords
 
exhaustive search
Property / zbMATH Keywords: exhaustive search / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorics
Property / zbMATH Keywords: combinatorics / rank
 
Normal rank
Property / zbMATH Keywords
 
optimization
Property / zbMATH Keywords: optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
output-sensitive
Property / zbMATH Keywords: output-sensitive / rank
 
Normal rank
Property / zbMATH Keywords
 
graphs
Property / zbMATH Keywords: graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
constraints
Property / zbMATH Keywords: constraints / rank
 
Normal rank

Revision as of 21:34, 27 June 2023

scientific article
Language Label Description Also known as
English
Memory-efficient enumeration of constrained spanning trees
scientific article

    Statements

    Memory-efficient enumeration of constrained spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration
    0 references
    exhaustive search
    0 references
    combinatorics
    0 references
    optimization
    0 references
    algorithms
    0 references
    output-sensitive
    0 references
    graphs
    0 references
    spanning trees
    0 references
    constraints
    0 references