F. A. Sharifov

Available identifiers

Publication	Date of Publication	Type
Finding the maximum cut by the greedy algorithm	2019-01-17	Paper
Perfect matching and polymatroids	2018-02-13	Paper
Models and complexity of problems of design and reconstruction of telecommunication and transport systems	2015-03-18	Paper
Perfect matchings and extended polymatroid	2008-09-24	Paper
Problems of synthesis of connected networks with respect to isomorphic subgraphs	2005-11-18	Paper
Efficiency of algorithms for solution of network problems with tree-like data structure	2005-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4828016	2004-11-24	Paper
Submodular functions in problems of synthesis of networks	2003-09-09	Paper
The problem of synthesis of reliable networks	2002-01-06	Paper
On the attack problem for a family of subsets	2001-09-13	Paper
Minimum cut problem using bases of extended polymatroids	1998-08-03	Paper
Simple multistage location problem on a treelike network	1997-01-20	Paper
Minimum cuts in parametric networks	1996-01-08	Paper
https://portal.mardi4nfdi.de/entity/Q3758558	1986-01-01	Paper

This page was built for person: F. A. Sharifov