A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
This paper presents a fast method to compute homeomorphisms between 2D lattices and shapes found in binary images. Unlike many other methods, this mapping is not restricted to sim...
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi ...