• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 6,115
Next 10 →

INTRINSICALLY LINKED GRAPHS

by Cara Nickolaus, Justin Raimondi, Joshua Wilson, Liang Zhang
"... Abstract. A graph is intrinsically linked if every embedding of the graph contains some pair of cycles that form a non-split link. Robertson, Seymour, and Thomas originally proved the minor-minimal 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 non-split link. Robertson, Seymour, and Thomas originally proved the minor-minimal set of intrinsically linked graphs to be the Petersen Family Graphs in 1995. We seek strategies

Amalgamations And Link Graphs Of Cayley Graphs

by J. Tomanova , 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

by Guantao Chen , et al.
"... A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2,..., xk, y1, y2,..., yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,..., Pk such that Pi joins xi and yi for i = 1, 2,..., k. Moreover, the above defined k-linked graph G is k-linked modulo (m1, m2 ..."
Abstract - Add to MetaCart
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2,..., xk, y1, y2,..., yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,..., Pk such that Pi joins xi and yi for i = 1, 2,..., k. Moreover, the above defined k-linked graph G is k-linked modulo (m1, m

A study of link graphs

by Bin Jia , 2014
"... ..."
Abstract - Add to MetaCart
Abstract not found

Distortion invariant object recognition in the dynamic link architecture

by Martin Lades, Jan C. Vorbrüggen, Joachim Buhmann, Christoph v. d. Malsburg, Rolf P. Würtz, Wolfgang Konen - 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 ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract - Cited by 637 (80 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 ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically

Analysis of Link Graph Compression Techniques

by David Hannah, Craig Macdonald, Iadh Ounis
"... 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 tech-niques 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 com-pression to the link graph. We compare several techniques of compress-ing link graphs, and conclude on speed

Intrinsically triple-linked graphs in RP³

by J. Federman, J. Foisy, K. McNamara , E. Stark , 2008
"... Flapan, et al [8] showed that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split three-component link (K10 is intrinsically triple-linked). The papers [2] and [7] extended the list of known intrinsically triple-linked graphs in R³ to include several other famili ..."
Abstract - Add to MetaCart
Flapan, et al [8] showed that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split three-component link (K10 is intrinsically triple-linked). The papers [2] and [7] extended the list of known intrinsically triple-linked graphs in R³ to include several other

Authoritative Sources in a Hyperlinked Environment

by Jon M. Kleinberg - 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

Statistical mechanics of complex networks

by Réka Albert, Albert-lászló Barabási - Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract - Cited by 2148 (11 self) - Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled

Goal-directed Requirements Acquisition

by Anne Dardenne , Axel van Lamsweerde, Stephen Fickas - SCIENCE OF COMPUTER PROGRAMMING , 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract - Cited by 585 (17 self) - Add to MetaCart
, such as goals to be achieved, agents to be assigned, alternatives to be negotiated, etc. The paper presents an approach to requirements acquisition which is driven by such higher-level concepts. Requirements models are acquired as instances of a conceptual meta-model. The latter can be represented as a graph
Next 10 →
Results 1 - 10 of 6,115
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University