AI Chat AI Image Generator AI Video Text to Speech

A Stronger Lower Bound on Parametric Minimum Spanning Trees

05/11/2021

∙

by David Eppstein, et al.

∙

∙

We prove that, for an undirected graph with n vertices and m edges, each labeled with a linear function of a parameter λ, the number of different minimum spanning trees obtained as the parameter varies can be Ω(mlog n).

page 1

page 2

page 3

page 4

research

∙ 03/18/2019

The facets of the spanning trees polytope

Let G=(V, E) be an undirected graph. The spanning trees polytope P(G) is...

0 Brahim Chaourar, et al. ∙

research

∙ 07/06/2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that ...

0 Joergen Bang-Jensen, et al. ∙

research

∙ 05/08/2020

Construction of Minimum Spanning Trees from Financial Returns using Rank Correlation

The construction of minimum spanning trees (MSTs) from correlation matri...

0 Tristan Millington, et al. ∙

research

∙ 05/27/2015

New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

We study three representations of hierarchies of partitions: dendrograms...

0 Jean Cousty, et al. ∙

research

∙ 04/10/2019

Minimum Spanning Trees in Weakly Dynamic Graphs

In this paper, we study weakly dynamic undirected graphs, that can be us...

0 Moustafa Nakechbandi, et al. ∙

research

∙ 04/15/2020

The Maximum Distance Problem and Minimal Spanning Trees

Given a compact E ⊂ℝ^n and s > 0, the maximum distance problem seeks a c...

0 Enrique G. Alvarado, et al. ∙

research

∙ 09/09/2019

A Classification Methodology based on Subspace Graphs Learning

In this paper, we propose a design methodology for one-class classifiers...

0 Riccardo La Grassa, et al. ∙