Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone  Home/Search
Context
Related
| rutgers.edu/~boros/Pape...BHRS00DAM.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~boros/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the n-dimensional ternary Hamming space, T n = f0; 1; 2g n , and say that a subset L T n of three points form a line if they have exactly n 1 components in common. A subset of T n is called closed if, whenever it contains two points of a line, it contains also the third one. Finally, a generator is a subset, whose closure, the smallest closed set containing it, is T n . In this paper, we investigate several combinatorial properties of closed sets and generators,... (Update)
Similar documents (at the sentence level):
31.4%: Combinatorial Problems Related to Origin-Destination.. - Boros, Hammer, Ricca.. (Correct)
19.4%: Closed Sets and Generators in Ternary Hamming Spaces - Boros, Hammer, al. (1998) (Correct)
6.1%: On the Complexity of Generation in Ternary Hamming Spaces - Boros, Hammer, Ricca.. (1998) (Correct)
Active bibliography (related documents): More All
0.1: On Connectivity Related Extremal Problems - Hajnal (Correct)
0.1: Approximate Graph Coloring by Semidefinite Programming - Karger, Motwani, Sudan (1994) (Correct)
0.0: Minimal Number of Permutations Sufficient to Compute All .. - Cholewinski.. (Correct)
Similar documents based on text: More All
1.1: R U T C O R - Rutcor Rutgers Center (2000) (Correct)
0.4: On the Number of Vertices Belonging to all Maximum Stable .. - Boros, Golumbic, Levit (2000) (Correct)
0.4: Optimal cell flipping to minimize channel density in VLSI.. - Boros, Hammer, al. (1998) (Correct)
BibTeX entry: (Update)
@article{ boros01combinatorial,
author = "Boros and Hammer and Ricca and Simeone",
title = "Combinatorial Problems Related to Origin-Destination Matrices",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "115",
year = "2001",
url = "citeseer.ist.psu.edu/article/boros00combinatorial.html" }
Citations (may not include all citations):158 Matroid Theory (context) - Welsh - 1976
42 Cambridge University Press (context) - Cameron - 1994
40 On representatives of subsets (context) - Hall - 1935
7 personal communication (context) - Szegedy - 1998
2 Closed Sets and Generators in Ternary Hamming Spaces - Boros, Hammer et al. - 1998
2 Introduction to Di erence Equations (context) - Goldberg - 1958
2 the Complexity of Generation in Ternary Hamming Spaces - Boros, Hammer et al. - 1998
Documents on the same site (http://rutcor.rutgers.edu/~boros/): More
Logical Analysis of Numerical Data - Boros, Hammer, Ibaraki, Kogan (2000) (Correct)
An Incremental RNC Algorithm for Generating All Maximal.. - Boros, Elbassioni, al. (2000) (Correct)
Stable Effectivity Functions and Perfect Graphs - Boros, Gurvich (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC