Suboptimal cuts: Their enumeration, weight and number (Q5204331): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithm for finding all minimal edge cuts of a nonoriented graph / 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
Property / cites work
 
Property / cites work: Q4037426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of all minimum cuts in a network and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank

Latest revision as of 05:01, 21 July 2024

scientific article; zbMATH DE number 7139645
Language Label Description Also known as
English
Suboptimal cuts: Their enumeration, weight and number
scientific article; zbMATH DE number 7139645

    Statements