scientific article; zbMATH DE number 7650133

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.66MaRDI QIDQ5875526

Samantha Petti, Michael Anastos, Peleg Michaeli

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1907.12043

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

zbMATH Keywords

connectivityrandom graphsmall subgraphshamiltonicty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small subgraphs in the trace of a random walk
• On the strength of connectedness of a random hypergraph
• Introduction to Random Graphs
• Emergence of Scaling in Random Networks
• On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
• Collective dynamics of ‘small-world’ networks
• Expanders via Random Spanning Trees
• Random Graphs

This page was built for publication: