Click here to flash read.
arXiv:2102.13193v2 Announce Type: replace-cross
Abstract: Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{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.
Click here to read this post out
ID: 818596; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 23, 2024, 7:34 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 9
CC:
No creative common's license
No creative common's license
Comments: