3757 search results - page 87 / 752 » The overlap number of a graph |
ECAI
1994
Springer
15 years 2 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
108
click to vote
CPC
2010
14 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
JGT
2008
14 years 10 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
120
click to vote
SDM
2012
SIAM
13 years 9 days ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
DM
2008
14 years 10 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...