Isomorphic unordered labeled trees up to substitution ciphering (Q2115877): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: treex / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184803410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4969116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-constrained matchings and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3047588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Matching Problems in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of leaves in a random recursive tree / rank
 
Normal rank

Latest revision as of 09:30, 28 July 2024

scientific article
Language Label Description Also known as
English
Isomorphic unordered labeled trees up to substitution ciphering
scientific article

    Statements

    Isomorphic unordered labeled trees up to substitution ciphering (English)
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    labeled unordered trees
    0 references
    tree isomorphism
    0 references
    substitution cipher
    0 references

    Identifiers