
Math General Math Forum  For general math related discussion and news 
 LinkBack  Thread Tools  Display Modes 
October 7th, 2016, 11:39 AM  #1 
Newbie Joined: Oct 2016 From: Paris Posts: 1 Thanks: 0  Graph Theory Optimization Problem
Hi everyone, I'm currently working on an algorithm aiming to find the best route between two vertices (the best, not the shortest...) My hypothesis :  G a connected graph  each vertex is graded (a grade out of 10 for example)  we call "mean of a path" the arithmetical mean of all the grades of the vertices of the path The problem is to find the best (i.e. the path that has the highest mean) between two given vertices A and B Do you have any recommandations for me ? Any ideas (of related fields or problems for example...) Thank you for your help 
October 7th, 2016, 11:53 AM  #2 
Senior Member Joined: Sep 2015 From: USA Posts: 2,452 Thanks: 1337 
This is similar but not identical to the longest path problem.


Tags 
graph, optimization, problem, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Graph theory problem  PrebKarl  Topology  0  October 27th, 2014 04:07 AM 
A graph problem in graph theory!  lubna_mira  Applied Math  0  January 12th, 2014 01:52 PM 
Interesting graph theory problem  alejopelaez  Applied Math  0  October 21st, 2013 01:32 PM 
Graph Theory Problem  hicheminfo  Applied Math  0  September 16th, 2012 10:22 AM 
graph theory problem  rayukpant  Computer Science  0  August 8th, 2011 06:50 PM 