Theorem 1. The induced matching 2-partition problem for graphs having diameter 6 is NP-complete.
定理1．直径为6的图的导出匹配2-划分问题是NP-完全的。
参考来源 - 图的广义着色·2,447,543篇论文数据，部分数据来源于NoteExpress
目的解决某些图类的导出匹配覆盖问题，特别是两条路的乘积图和非平凡树。
Aim To solve the induced matching cover problem of some graphs, such as the product of two paths and the nontrivial tree.
图3显示了两个彼此进行通信的SCA模块，并说明了SCA导入如何与sca导出匹配。
Figure 3 shows two SCA modules communicating with each other, and illustrates how an SCA import matches up with an SCA export.
在文件中指定模块名(必须与文件名匹配)，然后指定模块中希望导出到装载此模块的其他程序的函数。
You specify the module name in the file (and the file name must match), and then specify the functions within the module that you want to export to other programs that load the module.
应用推荐