An algorithm for \(k^{\text{th}}\) minimum spanning tree (Q327676): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640914 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)th minimum spanning tree
Property / zbMATH Keywords: \(k\)th minimum spanning tree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.05.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2518240130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding <i>K</i> Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) smallest spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for smallest spanning trees with a degree constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 12 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for \(k^{\text{th}}\) minimum spanning tree
scientific article

    Statements

    Identifiers