Results 1  10
of
31,018
On γConnected Sets
"... The definition of γconnectedness due to Császár [3] is modified and its basic properties are studied. The images and preimages of γ connected sets under (γ − γ′)continuous mapping are investigated. Sufficient conditions for a mapping to be (γ − γ′) continuous are given. ..."
Abstract
 Add to MetaCart
The definition of γconnectedness due to Császár [3] is modified and its basic properties are studied. The images and preimages of γ connected sets under (γ − γ′)continuous mapping are investigated. Sufficient conditions for a mapping to be (γ − γ′) continuous are given.
ON THE COMPACTNESS OF CONNECTED SETS
"... ABSTRACT: Let X be a space and U be an open cover of X. Then X is U chainable if for each x E X, sfXl(x, U) = X and it is Uunifonnly chainable if there is an n E N such that for each x E X, X = stn(x, U). In this paper we characterise connected spaces in tenns of Uchainability, connected spaces ..."
Abstract
 Add to MetaCart
ABSTRACT: Let X be a space and U be an open cover of X. Then X is U chainable if for each x E X, sfXl(x, U) = X and it is Uunifonnly chainable if there is an n E N such that for each x E X, X = stn(x, U). In this paper we characterise connected spaces in tenns of Uchainability, connected spaces
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
A Comparison of Algorithms for Connected Set Openings and Closings
 IEEE TRANS. PATT. ANAL. MACH. INTELL
, 2002
"... The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent unionfind approach. Unlike the earlier ..."
Abstract

Cited by 60 (12 self)
 Add to MetaCart
The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent unionfind approach. Unlike the earlier
Counting Connected Set Partitions of Graphs
"... Let G = (V,E) be a simple undirected graph with n vertices then a set partition π = {V1,..., Vk} of the vertex set of G is a connected set partition if each subgraph G[Vj] induced by the blocks Vj of π is connected for 1 ≤ j ≤ k. Define qi(G) as the number of connected set partitions in G with i bl ..."
Abstract
 Add to MetaCart
Let G = (V,E) be a simple undirected graph with n vertices then a set partition π = {V1,..., Vk} of the vertex set of G is a connected set partition if each subgraph G[Vj] induced by the blocks Vj of π is connected for 1 ≤ j ≤ k. Define qi(G) as the number of connected set partitions in G with i
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
Authoritative Sources in a Hyperlinked Environment
 JOURNAL OF THE ACM
, 1999
"... The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and repo ..."
Abstract

Cited by 3632 (12 self)
 Add to MetaCart
an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages ” that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving
Linked Data  The story so far
"... The term Linked Data refers to a set of best practices for publishing and connecting structured data on the Web. These best practices have been adopted by an increasing number of data providers over the last three years, leading to the creation of a global data space containing billions of assertion ..."
Abstract

Cited by 739 (15 self)
 Add to MetaCart
The term Linked Data refers to a set of best practices for publishing and connecting structured data on the Web. These best practices have been adopted by an increasing number of data providers over the last three years, leading to the creation of a global data space containing billions
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
Results 1  10
of
31,018