We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliffor...
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
In this paper, a novel method for accurate subject tracking, by selecting only tracked subject boundary edges in a video stream with a changing background and moving camera, is pr...
Myung-Cheol Roh, Tae-Yong Kim, Jihun Park, Seong-W...
— Two-dimensional (2-D) edge detection can be performed by applying a suitably selected optimal edge half-filter in n directions. Computationally, such a two-dimensional n-direc...
This paper proposes a wavelet based edge detection scheme by scale multiplication. The dyadic wavelet transforms at two adjacent scales are multiplied as a product function to mag...
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
This paper answers the following question: Given an \erector set" linkage, a connected set of xed-length links, what is the minimal needed to adjust the edge lengths so that ...