Minimum cost source location problem with local 3-vertex-connectivity requirements (Q870842): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Locating Sources to Meet Flow Demands in Undirected Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The source location problem with local 3-vertex-connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source location problems considering vertex-connectivity and edge-connectivity simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge connectivity between nodes and node-subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral structure of submodular and posi-modular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost source location problem with vertex-connectivity requirements in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cost Source Location Problems with Flow Requirements / rank
 
Normal rank

Latest revision as of 15:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimum cost source location problem with local 3-vertex-connectivity requirements
scientific article

    Statements

    Minimum cost source location problem with local 3-vertex-connectivity requirements (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2007
    0 references
    graph algorithm
    0 references
    undirected graph
    0 references
    location problem
    0 references
    local vertex-connectivity
    0 references
    polynomial time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references