Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
The following case study illustrates the migration of a report in which the report author utilizes levels from the same hierarchy in a nonadjacent format.
下面的案例研究展示了如何迁移这样一个报告:报告作者在报告中以不相邻格式利用来自相同层次结构的级别。
When using OLAP based packages, reports with nonadjacent levels from the same hierarchy will produce the following error.
在使用基于OLAP的程序包时,具有来自同一等级结构的不相邻等级的报表会产生以下错误。
The following case study will step a user through the transition of a report in which the report Author utilizes levels from the same hierarchy in a nonadjacent format.
以下案例研究将让一个用户逐渐转换一个报表,其中报表创建者以不相邻的格式利用来自同一等级结构的级别。
When using an OLAP-based package, a report with nonadjacent levels from the same hierarchy produces the following error.