The following pages link to Mao-cheng Cai (Q1055784):
Displaying 50 items.
- (Q186101) (redirect page) (← links)
- (Q620953) (redirect page) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- An algorithm for optimum common root functions of two digraphs (Q688253) (← links)
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph (Q811560) (← links)
- Computation of arbitrage in frictional bond markets (Q860869) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- Minimally k-connected graphs of low order and maximal size (Q1055785) (← links)
- A solution of Chartrand's problem on spanning trees (Q1062993) (← links)
- A new bound on the length of the shortest string containing all r- permutations (Q1166523) (← links)
- On a problem of Katona on minimal completely separating systems with restrictions (Q1171057) (← links)
- Solutions to Edmonds' and Katona's problems on families of separating subsets (Q1171074) (← links)
- On separating systems of graphs (Q1171075) (← links)
- A counterexample to a conjecture of Grant (Q1172647) (← links)
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices (Q1173631) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph (Q1198506) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- \((2,k)\)-factor-critical graphs and toughness (Q1299991) (← links)
- Inverse polymatroidal flow problem (Q1304389) (← links)
- An algorithm for an Eulerian trail traversing specified edges in given order (Q1343142) (← links)
- Connected \([k,k+1]\)-factors of graphs (Q1357718) (← links)
- Inverse matroid intersection problem (Q1362679) (← links)
- Approximate sequencing for variable length tasks. (Q1401212) (← links)
- On computational complexity of membership test in flow games and linear production games (Q1414436) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- A network improvement problem under different norms (Q1430275) (← links)
- Upper minus domination in regular graphs (Q1567668) (← links)
- Solution to a problem on degree sequences of graphs (Q1567678) (← links)
- Applications of matroid partition to tree decomposition (Q1568255) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- The complexity analysis of the inverse center location problem (Q1819202) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- \((3, k)\)-factor-critical graphs and toughness (Q1961763) (← links)
- Inverse problems of matroid intersection (Q1970339) (← links)
- Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph (Q1978168) (← links)
- Solution to a forcible version of a graphic sequence problem (Q2141340) (← links)
- Some new results on multi-dimension Knapsack problem (Q2386611) (← links)
- A characterization of box-bounded degree sequences of graphs (Q2413625) (← links)
- The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
- Existence of Hamiltonian \(k\)-factor (Q2574287) (← links)
- (Q2715335) (← links)
- An Approximation Algorithm for Feedback Vertex Sets in Tournaments (Q2719120) (← links)
- (Q2843928) (← links)
- COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE (Q3021978) (← links)
- (Q3030854) (← links)
- (Q3129189) (← links)
- (Q3360214) (← links)
