Results 1  10
of
149
A note on generalized chromatic number and generalized girth
 Discrete Math
, 2000
"... Abstract. Erdős proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring describes the partitioning of the vertices into classes whose induced subgraphs satisfy particular constraints. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
of this for a class of generalized coloring parameters. We consider the family P consisting of all graphs not containing H as a subgraph; we call the corresponding parameter the Hchromatic number and write it as χH. The natural extension requires an appropriate definition for generalized girth. For j ≥ 2
RINGS HAVING ZERODIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH
"... Let R be a commutative ring possessing (nonzero) zerodivisors. There is a natural graph associated to the set of zerodivisors of R. In this article we present a characterisation of two types of R. Those for which the associated zerodivisor graph has diameter different from 3 and those R for whi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
divisor graphs have received a good deal of attention. For a more comprehensive list of references the reader is requested to refer to the bibliographies of [1, 2, 4]. Zerodivisor graphs are highly symmetric and structurally very special; for example, in [4] this author has investigated the structure of cycles
Thresholds for Path Colorings of Planar Graphs
, 2005
"... A graph is path kcolorable if it has a vertex kcoloring in which the subgraph induced by each color class is a disjoint union of paths. A graph is path kchoosable if, whenever each vertex is assigned a list of k colors, such a coloring exists in which each vertex receives a color from its list. I ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A graph is path kcolorable if it has a vertex kcoloring in which the subgraph induced by each color class is a disjoint union of paths. A graph is path kchoosable if, whenever each vertex is assigned a list of k colors, such a coloring exists in which each vertex receives a color from its list
Deciding firstorder properties for sparse graphs
"... We present a lineartime algorithm for deciding firstorder logic (FOL) properties in classes of graphs with bounded expansion. Many natural classes of graphs have bounded expansion: graphs of bounded treewidth, all proper minorclosed classes of graphs, graphs of bounded degree, graphs with no sub ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
We present a lineartime algorithm for deciding firstorder logic (FOL) properties in classes of graphs with bounded expansion. Many natural classes of graphs have bounded expansion: graphs of bounded treewidth, all proper minorclosed classes of graphs, graphs of bounded degree, graphs
Spatial Color Component Matching of Images
 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR’02
, 2002
"... Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a challenging issue. In this paper we present a novel method for color layout based image matching called Spatial Color Compone ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
SCC lists. The algorithm has been evaluated using an image database of wall paper patterns and another database of natural images. It has been judged by human subjects to be highly effective in both cases. 1.
Highly symmetric subgraphs of hypercubes
 J. Algebraic Combin
"... Abstract. Two questions are considered, namely (i) How many colors are needed for a coloring of the ncube without monochromatic quadrangles or hexagons? We show that four colors suffice and thereby settle a problem of Erdos. (ii) Which vertextransitive induced subgraphs does a hypercube have? An ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
? An interesting graph has come up in this context: If we delete a Hamming code from the 7cube, the resulting graph is 6regular, vertextransitive and its edges can be twocolored such that the two monochromatic subgraphs are isomorphic, cubic, edgetransitive, nonvertextransitive graphs of girth 10. Keywords
ii List of Publications
, 2014
"... pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publiclyverifiable mixnet providing everlasting privacy. In Financial Cryptography, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios ..."
Abstract
 Add to MetaCart
pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publiclyverifiable mixnet providing everlasting privacy. In Financial Cryptography, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios
Credit Card Fraud Detection with a NeuralNetwork,”
 Proc. 27th Hawaii Int‟l Conf. System Sciences: Information Systems: Decision Support and KnowledgeBased Systems,
, 1994
"... Abstract Using data from a credit card issuer, a neural network based fraud detection system was trained on a large sample of labelled credit card account transactions and tested on a holdout data set that consisted of all account activity over a subsequent twomonth period of time. The neural netw ..."
Abstract

Cited by 74 (0 self)
 Add to MetaCart
of the high scoring transactions down to some threshold would be fraud; below this threshold, only good transactions would be ranked. However, perfect separability of frauds from goods is not possible due to the inherently nonseparable nature of the fraud and good distributions in the selected pattern
Edgepreserving colorization using datadriven random walks with restart
 In IEEE ICIP
, 2009
"... In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blending of the scribbles. Unlike previous works which utilize the shortest distance as the blending weights, we employ a new ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
intrinsic distance measure based on the Random Walks with Restart (RWR), known as a very successful technique for defining the relevance between two nodes in a graph. In our work, we devise new modified datadriven RWR framework that can incorporate locally adaptive and datadriven restarting probabilities
Results 1  10
of
149