Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes

IEICE Transactions on Information and Systems - Japan
doi 10.1587/transinf.2019pal0001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Related search

Balanced Partition of Minimum Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

How to Systematically Embed Cycles in Balanced Hypercubes

International Journal of Software Innovation
Computer GraphicsComputer NetworksCommunicationsComputer Science ApplicationsComputer-Aided DesignArtificial IntelligenceSoftware
2017English

Two Algorithms for Generating Weighted Spanning Trees in Order

SIAM Journal on Computing
MathematicsComputer Science
1977English

Constructing Trees

2019English

Computing the Wide Diameter of Regular Hyper-Star Networks Using Independent Spanning Trees

DEStech Transactions on Computer Science and Engineering
2017English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Decentralized Pricing in Minimum Cost Spanning Trees

SSRN Electronic Journal
2008English

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

2020English

Mst_clustering: Clustering via Euclidean Minimum Spanning Trees

The Journal of Open Source Software
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy