April 9th, 2017, 01:33 PM  #1 
Newbie Joined: Apr 2017 From: earth Posts: 1 Thanks: 0  graph theory (permution)
Hi all, I am struggling the question, please see attachments. Thanks a lot 20170409 (2).jpg Devise an algorithm which, given a (directed) friendship graph (in the xkcd format), finds the optimal seating arrangement. Your algorithm should include the following: a description of the required input format appropriate weightings of the four types of edges in the given friendship graph an output (an optimal seating arrangement) sufficient explanation of the variables and data structures involved that the marker can tell what they are for. 

Tags 
graph, permution, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Graph theory  diameter of biconnected graph  Estevan  Number Theory  2  November 4th, 2016 01:05 PM 
Graph Theory / Harary graph  hyenaa  Geometry  0  May 14th, 2015 12:10 PM 
A graph problem in graph theory!  lubna_mira  Applied Math  0  January 12th, 2014 02:52 PM 
Graph theory: Linking graph characteristics and minimal cut  avnerg  Applied Math  0  September 18th, 2013 06:03 AM 
graph theory  social networks and reverting the graph  johnyjj2  Applied Math  0  December 28th, 2010 03:49 PM 