The following pages link to Zhuo Diao (Q506542):
Displaying 22 items.
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Covering triangles in edge-weighted graphs (Q726109) (← links)
- Approximation algorithms for balancing signed graphs (Q2039689) (← links)
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- On weak Pareto optimality of nonatomic routing networks (Q2082187) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- On the vertex cover number of 3-uniform hypergraph (Q2240114) (← links)
- Packing and covering triangles in dense random graphs (Q2692229) (← links)
- Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing (Q2817846) (← links)
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles (Q2819510) (← links)
- Total Dual Integrality of Triangle Covering (Q2958309) (← links)
- Excluding Braess’s Paradox in Nonatomic Selfish Routing (Q3449597) (← links)
- On the feedback number of 3-uniform hypergraph (Q5129346) (← links)
- (Q5234777) (← links)
- Approximation algorithms on \(k\)-correlation clustering (Q6151012) (← links)
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs (Q6606247) (← links)
- Some combinatorial algorithms on the edge cover number of \(k\)-regular connected hypergraphs (Q6636093) (← links)
- Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains (Q6657226) (← links)
- A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\) (Q6658088) (← links)
