Abstract Let $$R_n $$ be the centered and normalized number of cycles fixed length contained in a generalized random graph with $$n vertices. We obtain Höffding-type exponential inequality for tail probability $$R_n$$ .

This paper is concerned with a new distance in undirected graphs with weighted edges, which gives new insights into the structure of all minimum spanning trees of a graph. This distance is a generalized one, in the sense that it takes values in a certain Heyting semigroup. More precisely, it associates with each pair of distinct vertices in a connected component of a graph the set of all paths ...

The language Grace is being proposed for specifying and programming in a graph-centered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structur-ing of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units deene comp...

We describe a body-worn sensor suite, environment representation, set of algorithms, and graphical-aural interface designed to provide human-centered guidance to a person moving through a complex space. The central idea underlying our approach is to model the environment as a graph of visually distinctive places (graph nodes) connected by path segments (graph edges). During exploration, our alg...

In this chapter, an interactive framework is developed to enable personalized news video recommendation and allow news seekers to access large-scale news videos more effectively. First, multiple information sources (audio, video and closed captions) are seamlessly integrated and synchronized to achieve more reliable news topic detection, and the inter-topic contextual relationships are extracte...

A continually increasing number of pictures and videos is shared in online social networks. Current sharing platforms, however, only offer limited options to define who has access to the content. Users may either share it with individuals or groups from their social graph, or make it available to the general public. Sharing content with users to which no social ties exist, even if they were phy...

A continually increasing number of pictures and videos is shared in online social networks. Current sharing platforms however only offer limited options to define who has access to the content. Users may either share it with individuals or groups from their social graph, or make it available to the general public. Sharing content with users to which no social ties exist, even if they were physi...

In this study, the author describes the nature and occurrence of knowledge-construction links (KCLs) in 3 6th-grade classrooms that varied in degree of learner centeredness. KCLs are operationalized as prior learning that students bring to their current classroom experiences and include school and nonschool experiences. They are hypothesized to facilitate a knowledge-construction process that v...

A graph G is an efficient open domination graph if there exists a subset D of V (G) for which the open neighborhoods centered in vertices of D form a partition of V (G). We completely describe efficient domination graphs among direct, lexicographic and strong products of graphs. For the Cartesian product we give a characterization when one factor is K2 and some partial results for grids, cylind...