DM
2006
13 years 4 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
DM
2006
13 years 4 months ago
2006
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...
DM
2006
13 years 4 months ago
2006
In this paper it is shown that every m
DAM
2006
13 years 4 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
CPC
2006
13 years 4 months ago
2006
Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl an...
COR
2006
13 years 4 months ago
2006
This paper presents the development process of an evaluation system to help the Portuguese PublicAdministration
COMBINATORICS
2006
13 years 4 months ago
2006
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
CJ
2006
13 years 4 months ago
2006
s the development of an abstract description of what there is in the world in an application-independent form. This paper argues that attempts to support information systems intero...
FGCS
2008
13 years 4 months ago
2008
This paper summarises ongoing research and recent results on the development of flexible access control infrastructure for complex resource provisioning in Grid-based collaborativ...
FGCS
2008
13 years 4 months ago
2008
This paper presents a grid-enabled system for solving large-scale mixed integer programming (MIP) problems. The system has been developed using Globus and MPICH-G2, and consists o...