| 单词 | outerplanar |
| 释义 | BETA Examples ofouterplanarDictionary> Examples ofouterplanar outerplanarisn’t in the Cambridge Dictionary yet. You can help! Add a definition We show that every planar graph is (3, 2) -choosable and everyouterplanargraph is (2, 2) -choosable. From theCambridge English Corpus There are no such o simple formulas known for generalouterplanargraphs. From theCambridge English Corpus We will then show how to modify the algorithm to generate unlabelled connectedouterplanargraphs uniformly at random in expected polynomial time. From theCambridge English Corpus In particular, they showed that everyouterplanargraph is (2, 2) -colourable and every planar graph is (3, 2) -colourable. From theCambridge English Corpus For instance,outerplanargraphs enjoy many nice properties both from an algorithmic and a structural point of view. From theCambridge English Corpus This allows us to make the correct probabilistic choices in a recursive generation of uniformly distributedouterplanargraphs. From theCambridge English Corpus In this paper we show how to efficiently generate random labelledouterplanargraphs. From theCambridge English Corpus In the following sections, when dealing withouterplanargraphs, we will therefore concentrate on the presentation of the decomposition strategy and the counting formulas. From theCambridge English Corpus We have found a short direct proof for the (2, 1) -choosability of triangle-freeouterplanargraphs. From theCambridge English Corpus In this paper, we will focus on the generation of randomouterplanargraphs according to their uniform distribution. From theCambridge English Corpus Throughout this section we assume that theouterplanargraphs are unlabelled and connected. From theCambridge English Corpus The reason why the decomposition into biconnected components of a graph is so useful is that biconnectedouterplanargraphs have a simple structure. From theCambridge English Corpus We present a uniform generation procedure forouterplanargraphs using rejection sampling. From theCambridge English Corpus And all triangle-freeouterplanargraphs are (m, d) choosable if and only if (m, d) > (2, 1) or (m, d) > (3, 0). From theCambridge English Corpus One may ask whether every planar graph is (3, 1) -choosable and everyouterplanargraph is (2, 1) choosable. From theCambridge English Corpus These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
| 随便看 |
英汉词典包含213609条英汉翻译词条，涵盖了常用英语单词及词组短语的翻译及用法，是英语学习的必备工具。