A new approach to operating with undirected trees

DOI10.1007/S10559-021-00335-ZOpenAlexW3128418159MaRDI QIDQ2043979FDOQ2043979

Authors: A. I. Ivaneshkin 

Publication date: 4 August 2021

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-021-00335-z

Recommendations

• Fast generation of unlabelled free trees using weight sequences
• scientific article; zbMATH DE number 3876615
• scientific article; zbMATH DE number 1234617
• Arithmetic for rooted trees
• scientific article; zbMATH DE number 1305528

zbMATH Keywords

isomorphismgraph treeset of software toolsundirected tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of software (68Nxx) Theory of computing (68Qxx) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Group-theoretic algorithms and graph isomorphism
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Universal information software technology for non-oriented mixed forests
• Unsafe operations in B-trees
• Title not available (Why is that?)
• Controlling the data space of tree structured computations
• Undirected mixed-forest graphs. Constructing isomorphic analogs and selective structure packing
• Transforming unbalanced multiway trees into a practical external data structure

This page was built for publication: A new approach to operating with undirected trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043979)