Extremum problems with separable graphs

DOI10.1023/A:1016387227459MaRDI QIDQ1406307zbMATH OpenOpenAlexFDO

Authors Yu S. Osipov, A. V. Kryazhimskij

Publication date 9 September 2003

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016387227459

zbMATH Keywords

dualityextremum problemsLagrangian functionsoptimality

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 4189765
• scientific article; zbMATH DE number 3258067
• scientific article; zbMATH DE number 3191789
• scientific article; zbMATH DE number 3470458
• scientific article; zbMATH DE number 3333193
• Extremal problems for multigraphs
• An extremal problem on the connectivity of graphs
• scientific article; zbMATH DE number 3788665
• An extremal problem in graph theory
• An extremal problem in graph theory

This page was built for publication: Extremum problems with separable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406307)