𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Nagata′s Pairwise Algorithm

✍ Scribed by W.Y. Chen; M.G. Leu

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
346 KB
Volume
165
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Nagata's Conjecture
On Nagata's Conjecture
✍ Brian Harbourne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

This paper gives an improved lower bound on the degrees d such that for general points p 1 p n ∈ P 2 and m > 0 there is a plane curve of degree d vanishing at each p i with multiplicity at least m.

An Adaptive Algorithm for Pairwise Compa
An Adaptive Algorithm for Pairwise Comparison-based Preference Measurement
✍ Martin Meißner; Reinhold Decker; Sören W. Scholz 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

## ABSTRACT The Pairwise Comparison‐based Preference Measurement (PCPM) approach has been proposed for products featuring a large number of attributes. In the PCPM framework, a static two‐cyclic design is used to reduce the number of pairwise comparisons. However, adaptive questioning routines that

On Holt's Algorithm
On Holt's Algorithm
✍ Greg Butler; John J. Cannon 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 138 KB

For a p-group generated by permutations, an algorithm is presented to compute generators of a subnormal series with the strong generating property required by Holt's algorithm.

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
✍ Qian-Ping Gu; Shietung Peng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype