computational complexity; graph theory; pattern clustering; AT-free graphs; NP-complete problem; bounded diameter; circular-arc graphs; distance-hereditary graphs; dually-chordal graphs; even integer; graph classes; graph clustering complexity; graph clustering partition problem; graph powers; odd integer; polynomial solvable problem; subgraph diameter; unified approach; vertex partitioning; Approximation algorithms; Bipartite graph; Clustering algorithms; Complexity theory; Computer science; Educational institutions; Polynomials; Diamete; Graph clustering; Graph powers; NP-completeness; Special graph classes;
机译:定向图的强连通性的新下限。应用于与Caccetta Ha:ggkvist猜想有关的特殊情况的直径定向图的强连通性上的新下界。应用于与Caccetta Ha:ggkvist猜想有关的特殊情况的直径定向图的强连通性上的新下界。适用于与Caccetta Ha:ggkvist猜想有关的特殊情况的直径
机译:少数簇的簇编辑的参数化复杂性的严格边界
机译:改进了笛卡尔图束的顶点和边缘断层直径的上限
机译:关于界直径的图形聚类的复杂性
机译:复杂性下限与元计算上限之间的连接
机译:代谢综合征中脂蛋白直径的聚类分析
机译:间隔图的定向直径和2个连接的适当间隔图的尖锐界限
机译:通过压缩感知进行量子断层扫描:误差界限,样本复杂度和有效估计