69 search results - page 13 / 14 » ejc 2008 |
EJC
2008
13 years 5 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
EJC
2008
13 years 6 months ago
2008
This paper presents a novel model of co-reference knowledge, which is based on the distinction of (i) a model of a common reality, (ii) a model of an agent's opinion about rea...
EJC
2008
13 years 6 months ago
2008
In this paper, we propose a news index system which supports users who would like to observe difference in various topics (e.g. politics, economy, education, and culture) among cou...
EJC
2008
13 years 3 months ago
2008
A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . ...
EJC
2008
13 years 3 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...