所属专辑:TOC计算理论 猜你喜欢 1.7万 NP2 by:Anna_Zhou 8754 NP1 by:Anna_Zhou 58.2万 绑定NP系统狂撩美男|夫君个个不好撩|女尊NP多夫 by:一品汤汤_汤汤剧社 1.7万 现代女穿越记 np by:司徒若语 1.2万 RAZ-P (Reading kids a-z P级)
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. These include perfect, chordal...
The only result related to our problem that we have found in the vast amount of literature on strings (e.g. [1], [6], [13], [17], [24]) is one that does not deal with combinatorics, but rather with language classes (see Section 6 for more details). Our problem is positioned ...
Since general fan-planar drawable graphs have at most 5n−10 edges and the same bound holds for 2-planar drawable graphs [37], we investigate the relationship between these two graph classes (observe that 1-planar graphs are always fan-planar by definition). More in general, we study the...
For such seizure detection and prediction systems, pattern recognition and machine learning algorithms are adopted to 'classify' an epoch of signal into different classes [21]. Some of the classes indicate the onset of seizure or ictal period of a seizure, and an alarm is supposed to be ...
Additionally, the complexity of data in relational databases is so high that the efficient retrieval of information has become a bottleneck in traditional information systems. On the side, Big Data has emerged into a decent solution for heterogenous and complex data (structured, semi-structured and ...