Home›Computational problems in graph theory›最大経路問題🌐日本語EnglishEspañolTiếng ViệtРусский日本語EntityQ7998708· pop 6· linked from 11 articles最大経路問題problem of maximizing the weight of the minimum-weight edge in the path between two verticesAvailable in 6 languagesEspañolРусскийSerbianTiếng ViệtUkrainianvia Wikidata sitelinks · CC0Connectionsmaximum flow problemEntitydense graphEntityCategoriesComputational problems in graph theoryGraph algorithmsNetwork theoryPolynomial-time problems