Results 1  10
of
500,643
SUBGRAPHS OF COMPLETE GRAPH
"... Abstract: In the complete graph K2m+3 for m ≥ 2, we study some structures of simple nonisomorphic Hamiltonian subgraphs of the form H ( 2m+3, 6m+3) for m ≥ 2. The various structures of the form H(2m+3, 6m+3) for m ≥ 2 are found and some of them are observed to give some forms of metal atom cluster ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: In the complete graph K2m+3 for m ≥ 2, we study some structures of simple nonisomorphic Hamiltonian subgraphs of the form H ( 2m+3, 6m+3) for m ≥ 2. The various structures of the form H(2m+3, 6m+3) for m ≥ 2 are found and some of them are observed to give some forms of metal atom
Connected Subgraph Detection
"... We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow for optimizing ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow
Graph Attribution Through SubGraphs
, 2012
"... We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked subgraph, in which the subgraph represents the data domain, rather than as a tuple of graph and algebra. This is a general construction which can be show ..."
Abstract
 Add to MetaCart
We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked subgraph, in which the subgraph represents the data domain, rather than as a tuple of graph and algebra. This is a general construction which can
Frequent Subgraph Mining on Edge Weighted Graphs
"... Abstract. Frequent subgraph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent subgraph min ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Abstract. Frequent subgraph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent subgraph
Weighted MUSE for Frequent Subgraph Pattern Finding
 in Uncertain DBLP Data. In Internet Technology and Applications (iTAP), 2011 International Conference on
, 2011
"... Abstract — Studies shows that finding frequent subgraphs in uncertain graphs database is an NP complete problem. Finding the frequency at which these subgraphs occur in uncertain graph database is also computationally expensive. This paper focus on investigation of mining frequent subgraph patter ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract — Studies shows that finding frequent subgraphs in uncertain graphs database is an NP complete problem. Finding the frequency at which these subgraphs occur in uncertain graph database is also computationally expensive. This paper focus on investigation of mining frequent subgraph
Clustering of taginduced subgraphs in complex networks
"... We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be important for practical applications like searching in the network ..."
Abstract
 Add to MetaCart
in the networks. Here we examine how the clustering coefficient changes when narrowing the network to a subgraph marked by a given tag, and how does it correlate with various other properties of the subgraph. Another interesting question addressed in the paper is how the clustering coefficient of the individual
GoFFish: A SubGraph Centric Framework for
"... Abstract. Vertex centric models for large scale graph processing are gaining traction due to their simple distributed programming abstraction. However, pure vertex centric algorithms underperform due to large communication overheads and slow iterative convergence. We introduce GoFFish a scalable su ..."
Abstract
 Add to MetaCart
subgraph centric framework codesigned with a distributed persistent graph storage for large scale graph analytics on commodity clusters, offering the added natural flexibility of shared memory subgraph computation. We map Connected Components, SSSP and PageRank algorithms to this model
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends
Sub Graph Approach In Iterative SumProduct Algorithm
"... A new scheduling algorithm to the iterative sumproduct algorithm, which is called subgraph scheduling, will be presented in this paper. The propesed algorithm provides a schedule which has a higher convergence rate than the iterative sumproduct algorithm while keeping the complexity of one iterat ..."
Abstract
 Add to MetaCart
A new scheduling algorithm to the iterative sumproduct algorithm, which is called subgraph scheduling, will be presented in this paper. The propesed algorithm provides a schedule which has a higher convergence rate than the iterative sumproduct algorithm while keeping the complexity of one
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1165 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Results 1  10
of
500,643