A polynomial-time algorithm for spanning tree modulus

Nathan Albin, Kapila Kottegoda, Pietro Poggi‐Corradini

Type: Preprint

Publication Date: 2020-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.2009.03736

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time	2005	Seth Pettie
+	Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time	2005	Seth Pettie Xiaotie Deng Ding‐Zhu Du
+	On the graceful numbering of spanning trees	1975	I. Cahit R. Cahit
+	Décompositions arborescentes et problèmes de routage	2014	Li Bi
+	The minimum vulnerability problem on specific graph classes	2015	Yusuke Aoki Bjarni V. Halldórsson Magnús M. Halldórsson Takehiro Ito Christian Konrad Xiao Zhou
+	Constant-time connectivity tests	2020	Philipp Klaus Krause
+	Graph vulnerability parameters, compression, and threshold graphs	2021	Nathan Kahl
+ PDF Chat	Combining Crown Structures for Vulnerability Measures	2024	Katrin Casel Tobias Friedrich Aikaterini Niklanovits К. V. Simonov Ziena Zeif
+	Graphes et hypergraphes : complexités algorithmique et algébrique	2007	Laurent Lyaudet
+	Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs	2010	Ruo-Wei Hung Maw‐Shang Chang
+	Polynomial Algorithm to Recognize a Meyniel Graph	1984	Michel Burlet Jean Fonlupt
+ PDF Chat	A simple certifying algorithm for 3-edge-connectivity	2023	Yung H. Tsin
+	Constant-time connectivity tests.	2020	Philipp Klaus Krause
+	Vulnerability in graphs of diameter five	2003	Cheng-de Xu
+	Finding Cliques of a Graph using Prime Numbers	2006	Dhananjay D. Kulkarni Shekhar Verma Prashant .
+	A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network	1992	Cheng'en Yang L. R. Foulds Jacob Scott
+	Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs	2010	Ruo-Wei Hung Maw‐Shang Chang
+	Master's thesis: Space-time tradeoffs for graph properties	1998	Yevgeniy Dodis
+	The Number of Spanning Trees in the Square of a Cycle	1985	Gerd Baron Helmut Prodinger Robert F. Tichy F Boesch J. F. Wang
+	The Edge Steiner Number of a Graph	2012	Malaysian Mathematical Michael B. Frondoza Sergio R. Canoy

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Fulkerson Duality for Modulus of Spanning Trees and Partitions	2023	Huy Truong Pietro Poggi‐Corradini

Works Cited by This (7)

Action	Title	Year	Authors
+ PDF Chat	Modulus of families of walks on graphs	2017	Nathan Albin Faryad Darabi Sahneh Max Goering Pietro Poggi‐Corradini
+ PDF Chat	Community detection in complex networks using extremal optimization	2005	Jordi Duch Àlex Arenas
+	Optimal attack and reinforcement of a network	1985	William H. Cunningham
+ PDF Chat	Minimal subfamilies and the probabilistic interpretation for modulus on graphs	2016	Nathan Albin Pietro Poggi‐Corradini
+ PDF Chat	Fairest edge usage and minimum expected overlap for random spanning trees	2021	Nathan Albin Jason Clemens Derek O'Keeffe Hoare Pietro Poggi‐Corradini Brandon Sit Sarah Tymochko
+ PDF Chat	Blocking duality for p-modulus on networks and applications	2018	Nathan Albin Jason Clemens Nethali Fernando Pietro Poggi‐Corradini
+ PDF Chat	Spanning tree modulus for secure broadcast games	2020	Nathan Albin Kapila Kottegoda Pietro Poggi‐Corradini