On the spanning trees of weighted graphs (Q6199477): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum of k-th maximal spanning trees of a weighted graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / 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
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank

Latest revision as of 13:13, 27 August 2024

scientific article; zbMATH DE number 7810442
Language Label Description Also known as
English
On the spanning trees of weighted graphs
scientific article; zbMATH DE number 7810442

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references