T

From Algorithm Wiki
Revision as of 22:06, 5 April 2019 by Yaboidom (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.

Retrieved from "https://algorist.com/algowiki_v2/index.php?title=T&oldid=607"