Bibliografi : hlm. 187
Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical…
Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of “magic” ideas have been applied to graphs. Recently there has been a resurgence of interest in “magic labelings” due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include: · a ne…
No Inv.: 88141-88143/P/Perp/04/3c~140712/SM/Perp/14/1c
No Inv.: 88177-88180/P/Perp/04/4c
No Inv.: 132042/SM/Perp/12/1c