Results 1  10
of
657,496
INTRINSICALLY LINKED GRAPHS
"... Abstract. A graph is intrinsically linked if every embedding of the graph contains some pair of cycles that form a nonsplit link. Robertson, Seymour, and Thomas originally proved the minorminimal set of intrinsically linked graphs to be the Petersen Family Graphs in 1995. We seek strategies to rep ..."
Abstract
 Add to MetaCart
Abstract. A graph is intrinsically linked if every embedding of the graph contains some pair of cycles that form a nonsplit link. Robertson, Seymour, and Thomas originally proved the minorminimal set of intrinsically linked graphs to be the Petersen Family Graphs in 1995. We seek strategies
Intrinsically knotted and 3linked Graph
"... Abstract. Intrinsically linked graphs are very important spatial graphs. We say that is intrinsically knotted and 3linked graph if every spatial embedding of this graph contains nontrivial knot and a nonsplit 3component link. This paper exhibit a new intrinsically knotted and 3linked graph. This ..."
Abstract
 Add to MetaCart
Abstract. Intrinsically linked graphs are very important spatial graphs. We say that is intrinsically knotted and 3linked graph if every spatial embedding of this graph contains nontrivial knot and a nonsplit 3component link. This paper exhibit a new intrinsically knotted and 3linked graph
Amalgamations And Link Graphs Of Cayley Graphs
, 1991
"... . The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups w ..."
Abstract
 Add to MetaCart
. The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups
Linked Graphs with Restricted Lengths
"... A graph G is klinked if G has at least 2k vertices, and for every sequence x1, x2,..., xk, y1, y2,..., yk of distinct vertices, G contains k vertexdisjoint paths P1, P2,..., Pk such that Pi joins xi and yi for i = 1, 2,..., k. Moreover, the above defined klinked graph G is klinked modulo (m1, m2 ..."
Abstract
 Add to MetaCart
A graph G is klinked if G has at least 2k vertices, and for every sequence x1, x2,..., xk, y1, y2,..., yk of distinct vertices, G contains k vertexdisjoint paths P1, P2,..., Pk such that Pi joins xi and yi for i = 1, 2,..., k. Moreover, the above defined klinked graph G is klinked modulo (m1, m
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
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Analysis of Link Graph Compression Techniques
"... Abstract. Links between documents have been shown to be useful in various Information Retrieval (IR) tasks for example, Google has been telling us for many years now that the PageRank authority measure is at the heart of its relevance calculations. To use such link analysis techniques in a search ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
engine, special tools are required to store the link matrix of the collection of documents, due to the high number of links typically involved. This work is concerned with the application of compression to the link graph. We compare several techniques of compressing link graphs, and conclude on speed
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 700 (14 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
Distortion invariant object recognition in the dynamic link architecture
 IEEE TRANSACTIONS ON COMPUTERS
, 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 636 (81 self)
 Add to MetaCart
We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically
Results 1  10
of
657,496