(Q52066136)

21 April 2018

title

Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. (English)

1 reference

21 April 2018

1 reference

1

1 reference

21 April 2018

author name string

Hartmann AK

series ordinal

2

1 reference

21 April 2018

language of work or name

English

0 references

publication date

1 February 2001

1 reference

21 April 2018

published in

Physical Review Letters

1 reference

21 April 2018

volume

86

1 reference

21 April 2018

issue

8

1 reference

21 April 2018

page(s)

1658-1661

1 reference

21 April 2018

Phase Transition in the Number Partitioning Problem

cites work

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem.

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

Finding a Maximum Independent Set

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

Branch-and-Bound Methods: A Survey

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

On the independence number of random graphs

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

Determining computational complexity from characteristic ‘phase transitions’

21 January 2018

1 reference

https://api.crossref.org/works/10.1103%2FPHYSREVLETT.86.1658

10.1103/PHYSREVLETT.86.1658

21 January 2018

Identifiers

DOI

1 reference

21 April 2018

1 reference

1 reference

21 April 2018