Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle

MaRDI QIDQ5485345zbMATH OpenFDO

Authors József Balogh, Boris Pittel, Gelasio Salazar

Publication date 29 August 2006

zbMATH Keywords

matchingalgorithmharmonious labelingnoncrossingconvex positionaverage case behaviorharmonic graphgraceful

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
• A note on harmonic subgraphs in labelled geometric graphs
• On Compatible Matchings
• Structural properties of bichromatic non-crossing matchings
• Matching colored points in the plane: Some new results

Cited in

(3)

• Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position
• On geometric graphs on point sets in the plane
• Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem

This page was built for publication: Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485345)