Counterexamples for Directed and Node Capacitated Cut-Trees
SIAM Journal on Computing
Discrete Mathematics
Counting minimum weight spanning trees
Journal of Algorithms
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Discrete Applied Mathematics
Metric and ultrametric spaces of resistances
Discrete Applied Mathematics
On exact blockers and anti-blockers, Δ-conjecture, and related problems
Discrete Applied Mathematics
Hi-index | 0.04 |
Let D=(V,A) be a complete directed graph (digraph) with a positive real weight function d:A-{d"1,...,d"k}@?R"+ such that 0