953 search results - page 17 / 191 » A note on the paper |
IWOCA
2009
Springer
14 years 6 days ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
AGP
1993
IEEE
13 years 11 months ago
1993
IEEE
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
FPL
1995
Springer
13 years 11 months ago
1995
Springer
Although the energy required to perform a logic operation has continuously dropped at least by ten orders of magnitude since early vacuumtube electronics [1], the increasing clock ...
CCCG
2007
13 years 9 months ago
2007
We study the problem of drawing a graph-theoretic path where each edge is assigned an axis-parallel direction in 3D. Di Battista et al.[3] gives a combinatorial characterization f...
ICISC
2007
13 years 9 months ago
2007
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...