scientific article; zbMATH DE number 7053276

zbMath1423.05150MaRDI QIDQ5743397

Hervé Daudé, Vonjy Rasendrahasina, Vlady Ravelomanana, Conrado Martínez

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095140

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Density (toughness, etc.) (05C42)

Related Items (1)

On the maximal cut in a random hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The first cycles in an evolving graph
• How frequently is a system of 2-linear Boolean equations solvable?
• The 3-XORSAT threshold.
• Counting connected graphs inside-out
• Satisfiability threshold for random XOR-CNF formulas
• The number of connected sparsely edged graphs. III. Asymptotic results
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
• Limit Theorems for Random MAX-2-XORSAT
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of connected sparsely edged graphs
• Random MAX SAT, random MAX CUT, and their phase transitions
• The birth of the giant component
• Some optimal inapproximability results
• Random 2-XORSAT at the Satisfiability Threshold
• MAX k‐CUT and approximating the chromatic number of random graphs
• On the Number of Husimi Trees

This page was built for publication: