✦ LIBER ✦

Combinatorial reconstruction problems

✍ Scribed by N Alon; Y Caro; I Krasikov; Y Roditty

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 715 KB
Volume: 47
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90016-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some combinatorial problems

✍ J. Akiyama; K. Hosono; M. Urabe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

On simple combinatorial optimization pro

On simple combinatorial optimization problems

✍ A.J. Hoffman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.

Three problems in combinatorial asymptot

Three problems in combinatorial asymptotics

✍ Herbert S Wilf 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 295 KB

On a reconstruction problem

✍ Bhalchandra D. Thatte 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 86 KB

This note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (Thatte, 1990, Section VI). For k = 1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed grap

Some combinatorial problems in the plane

✍ P. Erdös; G. Purdy 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 287 KB

The Crust and the β-Skeleton: Combinator

The Crust and the β-Skeleton: Combinatorial Curve Reconstruction

✍ Nina Amenta; Marshall Bern; David Eppstein 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely enough, the graph on the samples is a polygonalization of the curve, with no extraneous edges. The required sampling density varies with the local feature size on the cur