Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Submodular Functions on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroids, Representations, and Submodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Latest revision as of 16:23, 4 June 2024

scientific article
Language Label Description Also known as
English
Increasing digraph arc-connectivity by arc addition, reversal and complement
scientific article

    Statements