The most vital edges in the minimum spanning tree problem (Q1209313): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127343631, #quickstatements; #temporary_batch_1722436439543
 
(3 intermediate revisions by 3 users not shown)
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/0020-0190(93)90247-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988871016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital edge with respect to minimum spanning tree in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the most vital link in a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>n</i> Most Vital Links in Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127343631 / rank
 
Normal rank

Latest revision as of 15:35, 31 July 2024

scientific article
Language Label Description Also known as
English
The most vital edges in the minimum spanning tree problem
scientific article

    Statements

    The most vital edges in the minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    computational complexity
    0 references
    weighted network
    0 references
    most vital edges
    0 references
    minimum spanning tree
    0 references
    NP-hard
    0 references
    branch and bound algorithm
    0 references

    Identifiers