Small degree out‐branchings (Q4805223): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-preserving spanning trees in small-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for smallest spanning trees with a degree constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for degree-constrained minimum-cost network-design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank

Latest revision as of 15:13, 5 June 2024

scientific article; zbMATH DE number 1908433
Language Label Description Also known as
English
Small degree out‐branchings
scientific article; zbMATH DE number 1908433

    Statements

    Small degree out‐branchings (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2003
    0 references
    branchings
    0 references
    small degree
    0 references
    \(k\)-arc-strong
    0 references
    arc-disjoint branchings
    0 references
    acyclic digraph
    0 references
    connectivity
    0 references
    spanning tree
    0 references
    maximum degree
    0 references
    out-branching
    0 references
    in-branching
    0 references

    Identifiers