In this work, first, we present sufficient conditions for a bipartite digraph to attain optimum values of a stronger measure of connectivity, the so-called superconnectivity. To be more precise, we study the problem of disconnecting a maximally connected bipartite (di)graph by removing nontrivial subsets of vertices or edges. Within this framework, both an upper-bound on the diameter and Chartr...

In this paper we present a framework for estimating corrupted coefficients in multiple description coding (MDC) of images. Descriptions are generated by partitioning the domain of wavelet coefficients into sets whose elements are maximally separated from each other. Consequently an edge-adaptive estimation algorithm is proposed to explore the local texture statistical characteristics for estima...

Abstract A maximally linkless graph is a that can be embedded in without any links, but cannot such way if other edge added. Recently, family of ‐vertex graphs was found with edges. We improve upon this by demonstrating new at most

We present a novel activity representation as bags of event n-grams to extract global structural information of activities using their local event statistics. Exploiting this representation, we present a computational framework for unsupervised activityclass discovery, activity classification and anomalous activity detection. To this end, we model activity-classes as maximally similar activity-...

We present a method for tracking Maximally Stable Homogeneous Regions (MSHR) in images with an arbitrary number of channels. MSHR are conceptionally very similar to Maximally Stable Extremal Regions (MSER) and Maximally Stable Color Regions (MSCR), but can also be applied to hyperspectral and color images while remaining extremely efficient. The presented approach makes use of the edge-based co...

It is shown in this work that all n-dimensional hypercube networks for n P 4 are maximally 3-restricted edge connected. Employing this observation, we analyze the reliability of hypercube networks and determine the first 3n 5 coefficients of the reliability polynomial of n-cube networks. 2010 Published by Elsevier Inc.

We consider a complete graph to cluster the vertices into k-clusters, where each edge of the graph is labeled either as “+” or “–”. “+” denotes that vertices incident to the edge are mutually related and “–” edge denotes that the vertices incident to the edge are mutually unrelated. The goal of the clustering is to place vertices into k clusters, where documents are clustered with maximally rel...