Minimum Spanning Tree Cycle Intersection Problem

02/25/2021
by   Manuel Dubinsky, et al.
0

Consider a connected graph G and let T be a spanning tree of G. Every edge e ∈ G-T induces a cycle in T ∪{e}. The intersection of two distinct such cycles is the set of edges of T that belong to both cycles. We consider the problem of finding a spanning tree that has the least number of such non-empty intersections.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2023

Three aspects of the MSTCI problem

Consider a connected graph G and let T be a spanning tree of G. Every ed...
research
11/05/2017

Sparse Kneser graphs are Hamiltonian

For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...
research
10/16/2012

Generalized Belief Propagation on Tree Robust Structured Region Graphs

This paper provides some new guidance in the construction of region grap...
research
02/09/2018

Bootstrap validation of links of a minimum spanning tree

We describe two different bootstrap methods applied to the detection of ...
research
11/28/2022

Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty

This article studies the Minimum Spanning Tree Problem under Explorable ...
research
01/21/2018

Linking and Cutting Spanning Trees

We consider the problem of uniformly generating a spanning tree, of a co...
research
03/05/2015

Towards an intelligent VNS heuristic for the k-labelled spanning forest problem

In a currently ongoing project, we investigate a new possibility for sol...

Please sign up or login with your details

Forgot password? Click here to reset