A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The scaling limit of the minimum spanning tree of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Max-Flow Min-Cut theorem for countable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for Euclidean minimal spanning trees on random points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous-time network simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the Existence of Planning Horizons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the discovery of solution horizons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological paths, cycles and spanning trees in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph topologies induced by edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse optimization in minimum cost flow problems on countably infinite networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm for minimum-cost network-flow problems in infinite networks / rank
 
Normal rank

Revision as of 03:11, 31 July 2024

scientific article
Language Label Description Also known as
English
A greedy algorithm for finding maximum spanning trees in infinite graphs
scientific article

    Statements

    A greedy algorithm for finding maximum spanning trees in infinite graphs (English)
    0 references
    0 references
    12 December 2022
    0 references
    spanning trees
    0 references
    infinite graphs
    0 references
    infinite-dimensional optimization
    0 references

    Identifiers