Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - Physical Review E, 2014 - APS
The minimum vertex-cover problems on random α-uniform hypergraphs are studied using
two different approaches, a replica method in statistical mechanics of random systems and a …

[PDF][PDF] Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - arXiv preprint arXiv:1301.5769, 2013 - scholar.archive.org
We study minimum vertex cover problems on random α-uniform hypergraphs using two
different approaches, a replica method in statistical mechanics of random systems and a leaf …

Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - arXiv preprint arXiv:1301.5769, 2013 - arxiv.org
We study minimum vertex cover problems on random\alpha-uniform hypergraphs using two
different approaches, a replica method in statistical mechanics of random systems and a leaf …

[PDF][PDF] Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - arXiv preprint arXiv:1301.5769, 2013 - academia.edu
We study minimum vertex cover problems on random α-uniform hypergraphs using two
different approaches, a replica method in statistical mechanics of random systems and a leaf …

[PDF][PDF] Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - arXiv preprint arXiv:1301.5769, 2013 - researchgate.net
We study minimum vertex cover problems on random α-uniform hypergraphs using two
different approaches, a replica method in statistical mechanics of random systems and a leaf …

Minimum vertex cover problems on random hypergraphs: Replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - Physical Review E, 2014 - ui.adsabs.harvard.edu
The minimum vertex-cover problems on random α-uniform hypergraphs are studied using
two different approaches, a replica method in statistical mechanics of random systems and a …

[引用][C] Minimum vertex cover problems on random hypergraphs: Replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - Physical Review E, 2014 - cir.nii.ac.jp
Minimum vertex cover problems on random hypergraphs: Replica symmetric solution and a
leaf removal algorithm | CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] …

Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm.

S Takabe, K Hukushima - … review. E, Statistical, Nonlinear, and Soft …, 2014 - europepmc.org
The minimum vertex-cover problems on random α-uniform hypergraphs are studied using
two different approaches, a replica method in statistical mechanics of random systems and a …

Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm

S Takabe, K Hukushima - Physical review. E, Statistical …, 2014 - pubmed.ncbi.nlm.nih.gov
The minimum vertex-cover problems on random α-uniform hypergraphs are studied using
two different approaches, a replica method in statistical mechanics of random systems and a …