scientific article; zbMATH DE number 1301961

zbMath0927.05046MaRDI QIDQ4247194

Alan M. Frieze

Publication date: 13 December 1999

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

zbMATH Keywords

random walkexpander graphsedge disjoint path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (4)

[https://portal.mardi4nfdi.de/wiki/Publication:4810508 A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma] ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ On the maximum degree of path-pairable planar graphs ⋮ Sparsifying Congested Cliques and Core-Periphery Networks

This page was built for publication: