Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing residual flow under an arc destruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherent Measures of Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of finding small-diameter subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining market data: a network approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Approximation Algorithms for VRP with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based marketing: identifying likely adopters via consumer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk optimization with \(p\)-order conic constraints: a linear programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher moment coherent risk measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(p\)-norm linear discrimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum quasi-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized deviations in risk analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On risk-averse maximum weighted subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sample average approximation method applied to stochastic routing problems: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral approximations in<i>p</i>-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Revision as of 21:39, 15 July 2024

scientific article
Language Label Description Also known as
English
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
scientific article

    Statements

    Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2018
    0 references
    \(k\)-club
    0 references
    low-diameter clusters
    0 references
    stochastic graphs
    0 references
    coherent risk measures
    0 references
    combinatorial branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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