Difference between revisions of "T"

From Algorithm Wiki
Jump to: navigation, search
(Created page with "Each movie can be modeled as a vertex, each pair of films can be modeled as an edge between the two film vertices. If it is possible to make this a two-color graph, a schedule...")
 
m (Blanked the page)
Line 1: Line 1:
Each movie can be modeled as a vertex, each pair of films can be modeled as an edge between the two film vertices. If it is possible to make this a two-color graph, a schedule is possible. Films of one color would be shown Saturday, and the rest would be shown Sunday.
+
 

Revision as of 07:43, 15 April 2019