Extremum problems with separable graphs
From MaRDI portal
Publication:1406307
DOI10.1023/A:1016387227459zbMATH Open1033.90139OpenAlexW1543947331MaRDI QIDQ1406307
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
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Markov and semi-Markov decision processes (90C40)
Recommendations
- An extremal problem in graph theory 👍 👎
- Extremal problems for multigraphs 👍 👎
- An extremal problem on the connectivity of graphs 👍 👎
- An extremal problem in graph theory 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
