Results 1  10
of
645,724
kedge Subgraph Problems
 Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science
, 1996
"... We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of "spanning" to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We disc ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of "spanning" to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We
Minimally (k, k)Edge Connected Graphs
, 2001
"... Abstract: For an integer l> 1, the ledgeconnectivity of a connected graph with at least l vertices is the smallest number of edges whose removal results in a graph with l components. A connected graph G is (k; l)edgeconnected if the ledgeconnectivity of G is at least k. In this paper, we pr ..."
Abstract
 Add to MetaCart
present a structural characterization of minimally (k; k)edgeconnected graphs. As a result, former characterizations of minimally (2; 2)edgeconnected graphs in [J of Graph Theory 3 (1979), 15–22] are extended.
PACKING kEDGE TREES IN GRAPHS OF RESTRICTED VERTEX DEGREES
, 2006
"... Let G s r denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk(G) the maximum number of disjoint kedge trees in G. In this paper we show that (a1) if G ∈ G s 2 and s ≥ 4, then τ2(G) ≥ v(G)/(s + 1), (a2) if G ∈ G 3 2 and G has no 5vertex ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let G s r denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and τk(G) the maximum number of disjoint kedge trees in G. In this paper we show that (a1) if G ∈ G s 2 and s ≥ 4, then τ2(G) ≥ v(G)/(s + 1), (a2) if G ∈ G 3 2 and G has no 5
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
Edge Detection
, 1985
"... For both biological systems and machines, vision begins with a large and unwieldy array of measurements of the amount of light reflected from surfaces in the environment. The goal of vision is to recover physical properties of objects in the scene, such as the location of object boundaries and the s ..."
Abstract

Cited by 1277 (1 self)
 Add to MetaCart
about the physical properties of the scene are provided by the changes of intensity in the image. The importance of intensity changes and edges in early visual processg has led to extensive research on their detection, description and .use, both in computer and biological vision systems. This article
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 498 (68 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
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
A computational approach to edge detection
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1986
"... AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal ..."
Abstract

Cited by 4621 (0 self)
 Add to MetaCart
AbstractThis paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
Results 1  10
of
645,724