Results 1  10
of
62,991
Edgecolorings avoiding rainbow and monochromatic subgraphs
 Discrete Math
"... For two graphs G and H, let the mixed antiRamsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edgecoloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
For two graphs G and H, let the mixed antiRamsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edgecoloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic
Avoiding rainbow induced subgraphs in edgecolorings
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 44 (2009), PAGES 287–296
, 2009
"... Let H be a fixed graph on k edges. For an edgecoloring c of H, we say that H is rainbow, or totally multicolored if c assigns distinct colors to all edges of H. We show, that it is easy to avoid rainbow induced graphs H. Specifically, we prove that for any graph H (with some notable exceptions), an ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let H be a fixed graph on k edges. For an edgecoloring c of H, we say that H is rainbow, or totally multicolored if c assigns distinct colors to all edges of H. We show, that it is easy to avoid rainbow induced graphs H. Specifically, we prove that for any graph H (with some notable exceptions
Rainbow edgecoloring and rainbow domination
, 2012
"... Let G be an edgecolored graph with n vertices. A rainbow subgraph is a subgraph whose edges have distinct colors. The rainbow edgechromatic number of G, written ˆχ ′(G), is the minimum number of rainbow matchings needed to cover E(G). An edgecolored graph is ttolerant if it contains no monochroma ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
no monochromatic star with t+1 edges. If G is ttolerant, then ˆχ ′(G) < t(t + 1)n ln n, and examples exist with ˆχ ′(G) ≥ t 2 (n − 1). The rainbow domination number, written ˆγ(G), is the minimum number of disjoint rainbow stars needed to cover V (G). For ttolerant edgecolored nvertex graphs, we generalize
EdgeColorings With No Large Polychromatic Stars
, 1999
"... . Given a graph G and a positive integer r, let fr (G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine fr (Kn;n ) exactly and fr (Kn ) within 1. In doing so, we disprove ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
a conjecture by Manoussakis, Spyratos, Tuza and Voigt in [4]. 1. Introduction Let F and G be two graphs, and c be a coloring of E(G) (the edge set of G). F is said to be a rainbow subgraph (or polychromatic subgraph) of G, if G contains a subgraph isomorphic to F , all of whose edges are assigned
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Image registration methods: a survey
 IMAGE AND VISION COMPUTING
, 2003
"... This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align t ..."
Abstract

Cited by 734 (9 self)
 Add to MetaCart
This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align two images (the reference and sensed images). The reviewed approaches are classified according to their nature (areabased and featurebased) and according to four basic steps of image registration procedure: feature detection, feature matching, mapping function design, and image transformation and resampling. Main contributions, advantages, and drawbacks of the methods are mentioned in the paper. Problematic issues of image registration and outlook for the future research are discussed too. The major goal of the paper is to provide a comprehensive reference source for the researchers involved in image registration, regardless of particular application areas.
Results 1  10
of
62,991