The following pages link to F. A. Sharifov (Q220183):
Displaying 14 items.
- Perfect matching and polymatroids (Q681726) (← links)
- Perfect matchings and extended polymatroid (Q946789) (← links)
- Minimum cut problem using bases of extended polymatroids (Q1385774) (← links)
- Submodular functions in problems of synthesis of networks (Q1407173) (← links)
- Finding the maximum cut by the greedy algorithm (Q1711379) (← links)
- Simple multistage location problem on a treelike network (Q1816372) (← links)
- Minimum cuts in parametric networks (Q1905228) (← links)
- Models and complexity of problems of design and reconstruction of telecommunication and transport systems (Q2263339) (← links)
- Efficiency of algorithms for solution of network problems with tree-like data structure (Q2487904) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- On the attack problem for a family of subsets (Q2739604) (← links)
- (Q3758558) (← links)
- (Q4828016) (← links)
- The problem of synthesis of reliable networks (Q5951291) (← links)
