A set partition technique that is useful for identifying wires in cables can be recast in the language of 0 1 matrices, thereby resolving an open problem stated by R. L. Graham in Volume 1 of this journal. The proof involves a construction of 0 1 matrices having row and column sums without gaps.
β¦ LIBER β¦
The Graham-Knowlton Problem Revisited
β Scribed by Navin Goyal; Sachin Lodha; S. Muthukrishnan
- Book ID
- 105914825
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 211 KB
- Volume
- 39
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The KnowltonβGraham Partition Problem
β
Donald E. Knuth
π
Article
π
1996
π
Elsevier Science
π
English
β 232 KB
β
Flora, Kate
π
Fiction
π
2014
π
ePublishing Works!
π
en-US
β 426 KB
Portland, Maine, homicide detective Joe Burgess needs a vacation. But there's a dead child in Knowlton Park. Rolling up on the scene with a canoe on the roof and fishing poles flapping, Burgess finds little Timmy Watts, viciously stabbed, and carefully wrapped in a new blue blanket. Timmy's parent
The eponym problem revisited
β
Claude H. Organ Jr.
π
Article
π
1991
π
John Wiley and Sons
π
English
β 54 KB
The Weber problem revisited
β
Leon Cooper; I.Norman Katz
π
Article
π
1981
π
Elsevier Science
π
English
β 603 KB
The obstacle problem revisited
β
L. A. Caffarelli
π
Article
π
1998
π
SP BirkhΓ€user Verlag Boston
π
English
β 767 KB
The Birthday Problem Revisited
β
Jonny Griffiths
π
Article
π
1999
π
John Wiley and Sons
π
English
β 251 KB