Keywords: مستقل درختان کاشت; Spanning trees; Independent spanning trees; Disjoint connected dominating sets; Completely independent spanning trees; Grid;
مقالات ISI مستقل درختان کاشت (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: مستقل درختان کاشت; Parallel algorithms; Independent spanning trees; Interconnection networks; Twisted cubes;
Keywords: مستقل درختان کاشت; Circulant graphs; Gaussian networks; Spanning trees; Independent spanning trees; Fault-tolerant routing;
Keywords: مستقل درختان کاشت; Parallel algorithms; Independent spanning trees; Parity cubes; Interconnection networks
Constructing independent spanning trees with height n on the n-dimensional crossed cube
Keywords: مستقل درختان کاشت; Crossed cube; Independent spanning trees; Height; Reliable broadcasting;
Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees
Keywords: مستقل درختان کاشت; DNA sequence; Hypercube; Independent spanning trees; E-cube; Pattern recognition;
Connected-component labeling based on hypercubes for memory constrained scenarios
Keywords: مستقل درختان کاشت; Connected components; Image analysis; Hypercube graph; Independent spanning trees;
Structural properties of subdivided-line graphs
Keywords: مستقل درختان کاشت; Subdivided-line graph; Sierpiński graph; Edge-disjoint Hamilton cycles; Hamiltonian-connectivity; Hub set; Connected dominating set; Independent spanning trees; Completely independent spanning trees; Book-embedding
A comment on “Independent spanning trees in crossed cubes”
Keywords: مستقل درختان کاشت; Independent spanning trees; Interconnection networks; Crossed cubes; Multiply-twisted hypercube
Independent spanning trees in crossed cubes
Keywords: مستقل درختان کاشت; Interconnection networks; Crossed cubes; Independent spanning trees; Algorithms; Fault-tolerance
Independent spanning trees in crossed cubes
Keywords: مستقل درختان کاشت; Crossed cube; Independent spanning trees; Internally vertex-disjoint paths; Fault-tolerant broadcasting
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Keywords: مستقل درختان کاشت; Independent spanning trees; Fault-tolerant broadcasting; Parallel algorithms; Cartesian product; Generalized base-b hypercube
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Keywords: مستقل درختان کاشت; Independent spanning trees; Edge-disjoint spanning trees; Folded hypercubes; Interconnection networks; Fault-tolerant broadcasting
Independent spanning trees on even networks
Keywords: مستقل درختان کاشت; Independent spanning trees; Even networks; Internally disjoint paths; Algorithms
Constructing edge-disjoint spanning trees in twisted cubes
Keywords: مستقل درختان کاشت; Algorithms; Edge-disjoint spanning trees; Independent spanning trees; Data broadcasting; Fault-tolerance; Twisted cubes; Interconnection networks
Parallel construction of optimal independent spanning trees on hypercubes
Keywords: مستقل درختان کاشت; Independent spanning trees; Hypercubes; Internally disjoint paths; Latin square; Hamming distance; Algorithms