About: Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs Goto Sponge NotDistinct Permalink

An Entity of Type : wikibase:Item, within Data Space : wikidata.demo.openlinksw.com associated with source document(s)

Attributes	Values
rdf:type	Item
description	wetenschappelijk artikel (nl) наукова стаття, опублікована в серпні 2001 (uk) article scientifique publié en 2001 (fr) im August 2001 veröffentlichter wissenschaftlicher Artikel (de)
publication date	wds:Q58001608-9691D35D-C51D-465E-A54D-7E5B09DF9585
publication date	2001-08-01 00:00:00Z (xsd:dateTime)
cites work	wds:Q58001608-066327AD-B20A-4D41-897E-B8209B6B8A92 wds:Q58001608-0A60C8DF-1B6A-495E-90FC-79E16C5810EE wds:Q58001608-12DC6860-E77D-4881-A43B-9DD3D77C2DA2 wds:Q58001608-47A6BA14-ECDE-4C2F-A82E-CDA7D42517EA wds:Q58001608-73408B73-760F-4496-917A-24CC64CE1017 wds:Q58001608-8FED6EDA-F4A0-4340-8CA4-C9E07828C86E wds:Q58001608-A9B2EB9C-D583-484F-BD27-7DC975B4A43E wds:Q58001608-E2312F50-1D7B-43E7-BED9-EED02824F6F7 wds:Q58001608-E87B90F0-6B30-47AC-81FF-1FDD3A4507EE wds:Q58001608-E96A11BD-146F-4D94-8495-20843626E469 wds:Q58001608-F486A2A6-0F85-45DC-99C1-F5B9816FAD2C
cites work	Number of Guards Needed by a Museum: A Phase Transition in Vertex Covering of Random Graphs Determining computational complexity from characteristic ‘phase transitions’ Branch-and-Bound Methods: A Survey Cliques in random graphs A variational description of the ground state structure in random satisfiability problems On the independence number of random graphs Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem. Mean-field theory of spin-glasses with finite coordination number Phase Transition in the Number Partitioning Problem Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. Finding a Maximum Independent Set
author name string	wds:Q58001608-04263481-22F6-4968-AC91-F9D517EF0622 wds:Q58001608-24D17590-D4C5-48F4-995A-C8FDBC34CE38
author name string	Martin Weigt Alexander K. Hartmann
rdfs:label	Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (en) Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (nl)
skos:prefLabel	Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (en) Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (nl)
name	Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (en) Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (nl)
title	wds:Q58001608-F98DFB15-3C90-423E-BAD8-82782272C5B9
title	Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (en)
page(s)	wds:Q58001608-C1C80882-DEE1-49C7-A3E4-27FE6A6E4B7E
page(s)	199-225
instance of	wds:Q58001608-C9653F2D-323A-4076-8866-840F9EAD313B
instance of	scholarly article
main subject	wds:Q58001608-3E72D641-0FF7-44AA-A451-7600CAFEB8F6 wds:Q58001608-EDF5F209-8899-4B02-87D1-441AB6322CF5
main subject	statistics random graph
DBLP publication ID	wds:Q58001608-3006AF19-C9D7-4B0E-AEC3-5E991F575CFC
DBLP publication ID	https://dblp.org/rec/journals/tcs/HartmannW01
DBLP publication ID	journals/tcs/HartmannW01
published in	wds:Q58001608-765371B4-BDD9-4A93-9570-94883101FA21
published in	GI Symposium on Theoretical Computer Science
issue	wds:Q58001608-1DAC0C6D-5B3F-4534-9DF2-947A2261AC7F
volume	wds:Q58001608-ED2E7241-30A8-452C-ABE2-637FF6A06660
issue	1-2
volume	265
DOI	wds:Q58001608-DC7CA527-5BA2-4ECF-ABA5-A0EFBE6F3E2D
DOI	http://dx.doi.org/10.1016/S0304-3975(01)00163-3
DOI	10.1016/S0304-3975(01)00163-3
maintained by WikiProject	wds:Q58001608-BE8E5949-8E73-4507-93D5-1F61C67D925B
maintained by WikiProject	WikiProject Mathematics
zbMATH Open document ID	wds:Q58001608-51C3CA50-C1FC-4DD4-88C4-105BFF3ABEC9
zbMATH Open document ID	1026.82014
is about of	https://www.wikidata.org/wiki/Special:EntityData/Q58001608
is cites work of	Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms Statistical mechanics methods and phase transitions in optimization problems
is cites work of	wds:Q58001590-7988551C-12E2-487E-AD82-4D0572013414 wds:Q61444464-EED852E2-7197-43EA-8176-592A7716AD4E

Faceted Search & Find service v1.16.117 as of May 05 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of May 5 2024, on Linux (x86_64-centos_6-linux-gnu), Single-Server Edition (378 GB total memory, 183 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software