An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
Cormen, Charles E
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.
citing papers explorer
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
-
Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation
BDTS is a new data-structural framework for budgeted maintenance of rooted trace graphs, with Rust benchmarks showing compaction of 350k-2.71M tokens to 1k-4k tokens and model input reduction from ~3360 to ~432 tokens.