Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity (Q949511): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical basis for egress complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influence of molecular orientation on X-ray and optical scattering by liquids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal aspects of egress complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Generation of Rooted Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4463428 / rank
 
Normal rank

Latest revision as of 18:40, 28 June 2024

scientific article
Language Label Description Also known as
English
Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity
scientific article

    Statements

    Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity (English)
    0 references
    0 references
    0 references
    21 October 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    egress complexity
    0 references
    graph theory
    0 references
    rooted trees
    0 references
    information theory
    0 references
    Shannon entropy
    0 references
    0 references