Results 1  10
of
271,485
Rainbow Matching in EdgeColored Graphs
, 2010
"... A rainbow subgraph of an edgecolored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k ≥ 4, every edgecolored graph with minimum color degree at least k contains a rainbo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A rainbow subgraph of an edgecolored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li conjectured that for k ≥ 4, every edgecolored graph with minimum color degree at least k contains a
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
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
Edgecoloring in bipartite graphs
, 1997
"... Given a bipartite graph G with n nodes, m edges and maximum degree \Delta, we find an edge coloring for G using \Delta colors in time T + O(m log \Delta), where T is the time needed to find a perfect matching in a kregular bipartite graph with at most O(m) edges and k ^ \Delta. Together with best k ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Given a bipartite graph G with n nodes, m edges and maximum degree \Delta, we find an edge coloring for G using \Delta colors in time T + O(m log \Delta), where T is the time needed to find a perfect matching in a kregular bipartite graph with at most O(m) edges and k ^ \Delta. Together with best
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
Shape Matching and Object Recognition Using Shape Contexts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract

Cited by 1787 (21 self)
 Add to MetaCart
for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning trans form. We treat recognition in a nearestneighbor classification framework as the problem of finding the stored
SplitStream: HighBandwidth Multicast in Cooperative Environments
 SOSP '03
, 2003
"... In treebased multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for applicationlevel multicast in peertopeer systems. ..."
Abstract

Cited by 570 (17 self)
 Add to MetaCart
. SplitStreamadV esses this problem by striping the content across a forest of interiornodno# sjoint multicast trees that d stributes the forward ng load among all participating peers. For example, it is possible to construct efficient SplitStream forests in which each peer contributes only as much
Properly colored subgraphs and rainbow subgraphs in edgecolorings with local constraints
 ALGORITHMS
, 2003
"... We consider a canonical Ramsey type problem. An edgecoloring of a graph is called mgood if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every mgood edgecoloring of K n yields a properly edgecolored ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
We consider a canonical Ramsey type problem. An edgecoloring of a graph is called mgood if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every mgood edgecoloring of K n yields a properly edgecolored
Results 1  10
of
271,485