For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is
On Two Techniques of Combining Branching and Treewidth
β Scribed by Fedor V. Fomin; Serge Gaspers; Saket Saurabh; Alexey A. Stepanov
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 573 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper will motivate alternative combining schemes, provide a statistic for comparing alternative combinations out-of-sample and provide an example demonstrating these techniques. The evidence suggests the proposed procedures are likely to d o no worse than other approaches and promise to do bet
To examine associations between intakes of speci"c carbohydrates and cancer, we added values for three monosaccharides, three disaccharides, total sugar, and starch to our food composition table for the multi-ethnic population of Hawaii. For U.S. foods, the U.S. Department of Agriculture (USDA) has
## Abstract The photophysical and linear and nonlinear spectral properties of octupolar compounds with a triphenylbenzene core are investigated and compared with properties of corresponding dipolar branches. A correlation is found between the solvatochromic behavior and the twoβphoton absorption cr