例句與造句

1. Thus, perfection ( defined as the equality of maximum clique size and chromatic number in every induced subgraph ) is equivalent to the equality of maximum independent set size and clique cover number.
2. In a bipartite graph with no isolated vertices, the number of vertices in a maximum independent set equals the number of edges in a minimum edge covering; this is K鰊ig's theorem.
3. The complement of a vertex cover in any graph is an independent set, so a minimum vertex cover is complementary to a maximum independent set; finding maximum independent sets is another NP-complete problem.
4. The complement of a vertex cover in any graph is an independent set, so a minimum vertex cover is complementary to a maximum independent set; finding maximum independent sets is another NP-complete problem.
5. This technique has given PTASs for the following problems : subgraph isomorphism, maximum independent set, minimum vertex cover, minimum dominating set, minimum edge dominating set, maximum triangle matching, and many others.
6. It's difficult to find maximum independent set in a sentence. 用maximum independent set造句挺難的
7. Thus, the size of the maximum independent set in " G " is within a constant factor of the size of the longest induced path and the longest induced cycle in " H ".
8. Because these graphs are bipartite and have Hamiltonian paths, their maximum independent sets have a number of vertices that is equal to half of the number of vertices in the whole graph, rounded up to the nearest integer.
9. In planar graphs, the maximum independent set may be approximated to within any approximation ratio " c " < 1 in polynomial time; similar polynomial-time approximation schemes exist in any family of graphs closed under taking minors.
10. The equivalence between matching and covering articulated in K鰊ig's theorem allows minimum vertex covers and maximum independent sets to be computed in polynomial time for bipartite graphs, despite the NP-completeness of these problems for more general graph families.
11. The separator based divide and conquer paradigm has also been used to design data structures for dynamic graph algorithms and point location, and the construction of nearest neighbor graphs, and approximation algorithms for the maximum independent set of a planar graph.
12. Because of this decomposition, and because odd graphs are not bipartite, they have chromatic number three : the vertices of the maximum independent set can be assigned a single color, and two more colors suffice to color the complementary matching.
13. The size of the maximum independent set is the largest value stored at the root node, and the maximum independent set itself can be found ( as is standard in dynamic programming algorithms ) by backtracking through these stored values starting from this largest value.
14. The size of the maximum independent set is the largest value stored at the root node, and the maximum independent set itself can be found ( as is standard in dynamic programming algorithms ) by backtracking through these stored values starting from this largest value.
15. An complement of must be an independent set, and vice versa . is a minimal vertex cover if and only if its complement is a maximal independent set, and is a minimum vertex cover if and only if its complement is a maximum independent set.
16. However, many important and difficult graph optimization problems such as maximum independent set, graph coloring, and minimum dominating set can be approximated efficiently by using the geometric structure of these graphs, and the maximum clique problem can be solved exactly for these graphs in polynomial time, given a disk representation.
更多例句：  上一頁(yè)    下一頁(yè)