On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
type: Item
instance of: scholarly article
title: On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
author: Yanyan Li
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629136
zbMATH Keywords: leaf-distance granular regular \(\alpha\)-subtree (LDR \(\alpha\)-subtree)
zbMATH Keywords: weight
zbMATH Keywords: enumeration
zbMATH Keywords: generating function
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.ic.2022.104942
OpenAlex ID: W4285606494
cites work: Block-cutvertex trees and block-cutvertex partitions
cites work: Sparse reliable graph backbones
cites work: Finding connected \(k\)-subgraphs with high density
cites work: On the Number of Nonisomorphic Subtrees of a Tree
cites work: Atom-bond connectivity index of graphs
cites work: Wiener index of trees: Theory and applications
cites work: Block cutpoint decomposition for markovian queueing systems
cites work: Planar linear arrangements of outerplanar graphs
cites work: Structure and enumeration of two-connected graphs with prescribed three-connected components
cites work: Q5555548
cites work: Extremal results on average subtree density of series-reduced trees
cites work: Stack and Queue Layouts of Directed Acyclic Graphs: Part II
cites work: Mining frequent subgraphs in multigraphs
cites work: On the average number of nodes in a subtree of a tree
cites work: Largest Number of Subtrees of Trees with a Given Maximum Degree
cites work: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
cites work: Solving the maximum internal spanning tree problem on interval graphs in polynomial time
cites work: Two flow network simplification algorithms
cites work: On trees with a maximum proper partial 0-1 coloring containing a maximum matching
cites work: An algorithm for the blocks and cutnodes of a graph
cites work: On subtrees of trees
cites work: The average order of a subtree of a tree
cites work: Optimal fault-tolerant routings for connected graphs
cites work: On the Local and Global Means of Subtree Orders
cites work: Correlation of Graph‐Theoretical Indices
cites work: Trees with large numbers of subtrees
cites work: Enumeration of subtrees of trees
cites work: Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
cites work: On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
cites work: Subtrees of spiro and polyphenyl hexagonal chains
cites work: Enumeration of BC-subtrees of trees
cites work: The expected subtree number index in random polyphenylene and spiro chains
cites work: The minimal number of subtrees with a given degree sequence
cites work: Trees with the mos subtrees - an algorithmic approach
DOI: 10.1016/J.IC.2022.104942
description: scientific article; zbMATH DE number 7629136