Sciweavers

Share
2 search results - page 1 / 1
» The competition numbers of complete tripartite graphs
Sort
View
DAM
2008
85views more  DAM 2008»
8 years 8 months ago
The competition numbers of complete tripartite graphs
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
Suh-Ryung Kim, Yoshio Sano
COR
2010
123views more  COR 2010»
8 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
books