Fetching the paper…
Reading the bibliography…
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set.
Maximizing the number of spanning trees in a graph with n nodes and m edges
DR Shier · 1974
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions - I
George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher · 1978
Earlier work this paper cites.
Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
Ching-Shui Cheng · 1981
Earlier work this paper cites.
Random walks and electric networks., 1987
Kenneth B Stolarksy · 1987
Earlier work this paper cites.
On the existence of uniformly optimally reliable networks
Francis T Boesch, Xiaoming Li, and C Suffel · 1991
Earlier work this paper cites.
Resistance distance
Douglas J Klein and Milan Randić · 1993
Earlier work this paper cites.
The traveling salesman problem with distances one and two
Christos H. Papadimitriou and Mihalis Yannakakis · 1993
Earlier work this paper cites.
A proof of Boesch’s conjecture
Guifang Wang · 1994
Earlier work this paper cites.
On the complexity of approximating extremal determinants in matrices
Leonid Khachiyan · 1995
Earlier work this paper cites.
On graphs with the maximum number of spanning trees
Alexander K Kelmans · 1996
Earlier work this paper cites.
Reliable network synthesis: Some recent developments
Wendy Myrvold · 1996
Earlier work this paper cites.
Maximizing spanning trees in almost complete graphs
Bryan Gilbert and Wendy Myrvold · 1997
Earlier work this paper cites.
Matrix algebra from a statistician’s perspective
David A Harville · 1997
Earlier work this paper cites.
On the characterization of graphs with maximum number of spanning trees
Louis Petingi, Frank Boesch, and C Suffel · 1998
Earlier work this paper cites.
Approximation hardness of TSP with bounded metrics
Lars Engebretsen and Marek Karpinski · 2001
Earlier work this paper cites.
Spanning tree approach in all-terminal network reliability expansion
Nasser S. Fard and Taehan Lee · 2001
Earlier work this paper cites.
A new technique for the characterization of graphs with a maximum number of spanning trees
Louis Petingi and Jose Rodriguez · 2002
Earlier work this paper cites.
Maximizing the spread of influence through a social network
David Kempe, Jon M. Kleinberg, and Éva Tardos · 2003
Earlier work this paper cites.
Square root sam: Simultaneous localization and mapping via square root information smoothing
Frank Dellaert and Michael Kaess · 2006
Earlier work this paper cites.
Growing well-connected graphs
Arpita Ghosh and Stephen Boyd · 2006
Earlier work this paper cites.
Parameterized complexity and improved inapproximability for computing the largest j-simplex in a v-polytope
Ioannis Koutis · 2006
Earlier work this paper cites.
The graph SLAM algorithm with applications to large-scale mapping of urban structures
Sebastian Thrun and Michael Montemerlo · 2006
Earlier work this paper cites.
On selecting a maximum volume sub-matrix of a matrix and related problems
Ali Çivril and Malik Magdon-Ismail · 2009
Cited alongside, same era.
Subgraph sparsification and nearly optimal ultrasparsifiers
Alexandra Kolla, Yury Makarychev, Amin Saberi, and Shang-Hua Teng · 2010
Cited alongside, same era.
Incremental spectral clustering by efficiently updating the eigen-system
Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, and Thomas S. Huang · 2010
Cited alongside, same era.
Limiting the spread of misinformation in social networks
Ceren Budak, Divyakant Agrawal, and Amr El Abbadi · 2011
Cited alongside, same era.
G 2 {}^{\mbox{2}} o: A general framework for graph optimization
Rainer Kümmerle, Giorgio Grisetti, Hauke Strasdat, Kurt Konolige, and Wolfram Burgard · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2011
Faster spectral sparsification and numerical algorithms for SDD matrices
Ioannis Koutis, Alex Levin, and Richard Peng · 2016
Later among the works it cites.
Approximate gaussian elimination for laplacians - fast, sparse, and simple
Rasmus Kyng and Sushant Sachdeva · 2016
Later among the works it cites.
Designing sparse reliable pose-graph SLAM: A graph-theoretic approach
Kasra Khosoussi, Gaurav S Sukhatme, Shoudong Huang, and Gamini Dissanayake · 2016
Later among the works it cites.
Maximizing the weighted number of spanning trees: Near- t t -optimal graphs
Kasra Khosoussi, Gaurav S. Sukhatme, Shoudong Huang, and Gamini Dissanayake · 2016
Later among the works it cites.
Scalable betweenness centrality maximization via sampling
Ahmad Mahmoody, Charalampos E. Tsourakakis, and Eli Upfal · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Graph-theoretic connectivity control of mobile robot networks
M. M. Zavlanos, M. B. Egerstedt, and G. J. Pappas · 2011
Cited alongside, same era.
Exponential inapproximability of selecting a maximum volume sub-matrix
Ali Çivril and Malik Magdon-Ismail · 2013
Cited alongside, same era.
Performance and design of cycles in consensus networks
Daniel Zelazo, Simone Schuler, and Frank Allgöwer · 2013
Cited alongside, same era.
Maximizing social influence in nearly optimal time
Christian Borgs, Michael Brautbar, Jennifer T. Chayes, and Brendan Lucier · 2014
Cited alongside, same era.
Fast algorithms for maximizing submodular functions
Ashwinkumar Badanidiyuru and Jan Vondrák · 2014
Cited alongside, same era.
Solving sdd linear systems in nearly mlog1/2n time
Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu · 2014
Cited alongside, same era.
Aleksandar Nikolov and Mohit Singh · 2016
Later among the works it cites.
On submodularity and controllability in complex dynamical networks
Tyler H Summers, Fabrizio L Cortesi, and John Lygeros · 2016
Later among the works it cites.
Near-optimal design of experiments via regret minimization
Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, and Yining Wang · 2017
Later among the works it cites.
Near-optimal discrete optimization for experimental design: A regret minimization approach
Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, and Yining Wang · 2017
Later among the works it cites.
Sampling random spanning trees faster than matrix multiplication
David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, and Sushant Sachdeva · 2017
Later among the works it cites.
Determinant-preserving sparsification of SDDM matrices with applications to counting and sampling spanning trees
David Durfee, John Peebles, Richard Peng, and Anup B. Rao · 2017
Later among the works it cites.
A nearly-linear time algorithm for submodular maximization with a knapsack constraint
Alina Ene and Huy L. Nguyen · 2017
Later among the works it cites.
Subdeterminant maximization via nonconvex relaxations and anti-concentration
Javad B. Ebrahimi, Damian Straszak, and Nisheeth K. Vishnoi · 2017
Later among the works it cites.
An sdp-based algorithm for linear-sized spectral sparsification
Yin Tat Lee and He Sun · 2017
Later among the works it cites.
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, and Junxing Wang · 2018
Closest in time.
Fully dynamic effective resistances
David Durfee, Yu Gao, Gramoz Goranci, and Richard Peng · 2018
Closest in time.
Current flow group closeness centrality for complex networks
Huan Li, Richard Peng, Liren Shan, Yuhao Yi, and Zhongzhi Zhang · 2018
Closest in time.
Kirchhoff index as a measure of edge centrality in weighted networks: Nearly linear time algorithms
Huan Li and Zhongzhi Zhang · 2018
Closest in time.
An almost-linear time algorithm for uniform random spanning tree generation
Aaron Schild · 2018
Closest in time.
Growing linear dynamical networks endowed by spectral systemic performance measures
M. Siami and N. Motee · 2018
Closest in time.
Approximate positive correlated distributions and approximation algorithms for d-optimal design
Mohit Singh and Weijun Xie · 2018
Closest in time.