Rooted \(k\)-connections in digraphs (Q1025990): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and matroid partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rooted directed cuts in a weighted directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the rooted connectivity of a digraph by one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On combinatorial structures of line drawings of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of structural inconsistency in systems of equations with degrees of freedom and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for edge-disjoint branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank

Revision as of 16:30, 1 July 2024

scientific article
Language Label Description Also known as
English
Rooted \(k\)-connections in digraphs
scientific article

    Statements

    Rooted \(k\)-connections in digraphs (English)
    0 references
    0 references
    23 June 2009
    0 references
    matroid intersection
    0 references
    connectivity of digraphs
    0 references
    arborescences
    0 references

    Identifiers