The following pages link to Zhenhong Liu (Q199348):
Displayed 50 items.
- (Q689127) (redirect page) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- A solution to one of Kano's conjectures concerning k-th maximal spanning trees (Q1119659) (← links)
- Polynomial algorithms to finite Veber problem for a tree network (Q1176800) (← links)
- A cyclic method for channel routing (Q1176940) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- Transitive multipermutation graphs: Case \(4\leq n\leq m\) (Q1183982) (← links)
- Parallel chip firing games on graphs (Q1184999) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- Pebbling graphs (Q1204476) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor (Q1272538) (← links)
- A further study on inverse linear programming problems (Q1298792) (← links)
- On connected factors in \(K_{1,3}\)-free graphs (Q1299861) (← links)
- On 2-factors in claw-free graphs (Q1304816) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Largest size and union of Helly families (Q1322238) (← links)
- The domatic number problem (Q1322260) (← links)
- On distance-biregular graphs of girth divisible by four (Q1323493) (← links)
- On automorphism groups of some PCS graphs (Q1334946) (← links)
- Comparison of formulations and a heuristic for packing Steiner trees in a graph (Q1339122) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373) (← links)
- On inverse problems of optimum perfect matching (Q1417847) (← links)
- Some reverse location problems (Q1576337) (← links)
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm (Q1598883) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (Q1806920) (← links)
- Odd wheels in graphs (Q1850586) (← links)
- Kite-free distance-regular graphs (Q1896339) (← links)
- Packing Steiner trees: Further facets (Q1908272) (← links)
- Distance-regularity and the spectrum of graphs (Q1911436) (← links)
- A new result on local forbidden graph and hamiltonicity (Q1913915) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- Highly irregular bipartite graphs (Q1917732) (← links)
- Calculating some inverse linear programming problems (Q1923457) (← links)
- On connencted \([g,f+1]\)-factors in graphs (Q2568495) (← links)
- (Q3122928) (← links)
- (Q3360209) (← links)
- (Q3703923) (← links)
- (Q3734438) (← links)
- (Q3770300) (← links)
- (Q3800077) (← links)
- (Q3801599) (← links)
- (Q3934411) (← links)
- (Q3981326) (← links)
- (Q3985793) (← links)
- (Q4030562) (← links)
- (Q4031930) (← links)
- (Q4037885) (← links)