The following pages link to Algorithms – ESA 2005 (Q5475831):
Displaying 23 items.
- Unbalanced graph partitioning (Q372961) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- Modularity-maximizing graph communities via mathematical programming (Q977873) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- Finding the probability of infection in an SIR network is NP-hard (Q1926503) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- On the inapproximability of minimizing cascading failures under the deterministic threshold model (Q2350582) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- On efficient vaccine distribution strategy to suppress pandemic using social relation (Q2798324) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- (Q5111689) (← links)
- Contrasting the Spread of Misinformation in Online Social Networks (Q5139596) (← links)
- (Q5743436) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
