Fetching the paper…
Reading the bibliography…
A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least one vertex of each cycle of the graph.
Statistical theory of superlattices
H. A. Bethe · 1935
Earlier work this paper cites.
Statistical theory of superlattice with unequal concentrations of the components
R. Peierls · 1936
Earlier work this paper cites.
On Ising’s model of ferromagnetism
R. Peierls · 1936
Earlier work this paper cites.
A theory of cooperative phenomena
R. Kikuchi · 1951
Earlier work this paper cites.
The complexity of theorem-proving procedures
S. A. Cook · 1971
Earlier work this paper cites.
Reducibility among combinatorial problems
R. M. Karp · 1972
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. Garey and D. S. Johnson · 1979
Earlier work this paper cites.
The deadlock problem: a classifying bibliography
D. Zöbel · 1983
Earlier work this paper cites.
A note on the cluster variation method
G. An · 1988
Earlier work this paper cites.
Decycling graphs
L. W. Beineke and R. C. Vandell · 1997
Earlier work this paper cites.
A 2 2 -approximation algorithm for the undirected feedback vertex set problem
V. Bafna, P. Berman, and T. Fujito · 1999
Earlier work this paper cites.
The Bethe lattice spin glass revisited
M. Mézard and G. Parisi · 2001
Cited alongside, same era.
Decycling numbers of random regular graphs
S. Bau, N. C. Wormald, and S.-M. Zhou · 2002
Cited alongside, same era.
Loops of any size and Hamilton cycles in random scale-free networks
G. Bianconi and M. Marsili · 2005
Cited alongside, same era.
An algorithm for counting circuits: Application to real-world and random graphs
E. Marinari, R. Monasson, and G. Semerjian · 2006
Cited alongside, same era.
On the number of circuits in random graphs
E. Marinari and G. Semerjian · 2006
Cited alongside, same era.
Finding long cycles in graphs
E. Marinari, G. Semerjian, and V. Van Kerrebroeck · 2007
Cited alongside, same era.
Controllability of complex networks
Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási · 2011
Later among the works it cites.
Finding undetected protein associations in cell signaling by belief propagation
M. Bailly-Bechet, C. Borgs, A. Braunstein, J. Cheyes, A. Dagkessamanskaia, J.-M. Francois, and R. Zecchina · 2011
Later among the works it cites.
Partition function loop series for a general graphical model: free-energy corrections and message-passing equations
J.-Q. Xiao and H.-J. Zhou · 2011
Later among the works it cites.
Partition function expansion on region-graphs and message-passing equations
H.-J. Zhou, C. Wang, J.-Q. Xiao, and Z. Bi · 2011
Later among the works it cites.
Performance of a cavity-method-based algorithm for the prize-collecting steiner tree problem on graphs
I. Biazzo, A. Braunstein, and R. Zecchina · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Bianconi and N. Gulbahce · 2008
Cited alongside, same era.
Statistical mechanics of steiner trees
M. Bayati, C. Borgs, A. Braunstein, J. Chayes, A. Ramezanpour, and R. Zecchina · 2008
Cited alongside, same era.
Complex Systems and Complex Networks
Da-Ren He, Zong-Hua Liu, and Bing-Hong Wang · 2009
Cited alongside, same era.
Information, Physics, and Computation
M. Mézard and A. Montanari · 2009
Cited alongside, same era.
Region graph partition function expansion and approximate free energy landscapes: Theory and some numerical results
H.-J. Zhou and C. Wang · 2012
Later among the works it cites.
Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks
B. Fiedler, A. Mochizuki, G. Kurosawa, and D. Saito · 2013
Closest in time.
Dynamics and control at feedback vertex sets. II: A faithful monitor to determine the diversity of molecular activities in regulatory networks
A. Mochizuki, B. Fiedler, G. Kurosawa, and D. Saito · 2013
Closest in time.
Observability of complex systems
Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási · 2013
Closest in time.
Ising formulations of many NP problems
A. Lucas · 2013
Closest in time.