A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A note on harmonic subgraphs in labelled geometric graphs
2008
Information Processing Letters
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . . , n − 1}. Each edge (the straight segment that joins two points) is labelled with the sum of the labels of its endpoints. In this note we investigate the maximum size of noncrossing matchings and paths on S, under the requirement that no two edges have the same weight.
doi:10.1016/j.ipl.2007.08.016
fatcat:tvlfpmn2pnhudf3zypa7r4h5m4