Two faces of greedy leaf removal procedure on graphs
From MaRDI portal
Publication:5132111
DOI10.1088/1742-5468/ab2ccazbMath1456.05033arXiv1809.05843OpenAlexW2891767116WikidataQ125954810 ScholiaQ125954810MaRDI QIDQ5132111
Publication date: 9 November 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.05843
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
A local algorithm and its percolation analysis of bipartite z-matching problem ⋮ Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks
- Statistical mechanics of the minimum dominating set problem
- On the independence number of random graphs
- Matching theory
- A lower bound on the independence number of a graph
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- Complex networks: structure and dynamics
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Typical performance of approximation algorithms for NP-hard problems
- Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Information, Physics, and Computation
- An Efficient Parallel Biconnectivity Algorithm
- Independent sets in random sparse graphs
- The Structure and Function of Complex Networks
- Factor graphs and the sum-product algorithm
- Community structure in social and biological networks
- Networks
- A critical point for random graphs with a given degree sequence
- Statistical Physics of Spin Glasses and Information Processing
- Handbook of Combinatorial Optimization
- On the origins of hierarchy in complex networks
- The number of matchings in random graphs
- Collective dynamics of ‘small-world’ networks
- Phase Transitions in Combinatorial Optimization Problems
- Statistical mechanics of the vertex-cover problem
- Statistical theory of superlattices
This page was built for publication: Two faces of greedy leaf removal procedure on graphs
