What people are saying - Write a review
We haven't found any reviews in the usual places.
Maximum Weight Triangulation and Its Application on Graph Drawing
34 other sections not shown
Other editions - View all
algorithm Alice and Bob approximation approximation algorithm Bahncard binary tree boolean central path chain circuit circulant graphs Clos network competitive ratio complexity Computer Science consider construction contains convex CSST curve data structure defined definition denote diagonal diagonal-flip distance dm-block edge elements Eulerian Eye(s function given graph G hamiltonian cycle hamiltonian graphs Hence Hilbert Hilbert curves inherent dimension input integer internal Lemma length lower bound makespan Markov chain matrix maximum middle switches minimum weight triangulation multicast neighborhood node nonblocking obtain online algorithm optimal output packets paper parallel partition pebble permutation permutation graph players point set polygon polynomial problem Proceedings processors Proof protocol query random randomized algorithm recursive request resp root Section segment sequence space stage steps strategy subgraphs subset symmetric technique tests Theorem type-3 dimension ultrametric ultrametric tree unit with concentration upper bound variables vector vertex vertices