Results 1  10
of
8,668
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 1791 (69 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
The program dependence graph and its use in optimization
 ACM Transactions on Programming Languages and Systems
, 1987
"... In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program. ..."
Abstract

Cited by 996 (3 self)
 Add to MetaCart
In this paper we present an intermediate program representation, called the program dependence graph (PDG), that makes explicit both the data and control dependence5 for each operation in a program. Data dependences have been used to represent only the relevant data flow relationships of a program
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3526 (46 self)
 Add to MetaCart
to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large. We present experimental results from applying these algorithms to problems in logic design verification that demonstrate the practicality of our approach.
An open graph visualization system and its applications to software engineering
 SOFTWARE  PRACTICE AND EXPERIENCE
, 2000
"... We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout alg ..."
Abstract

Cited by 453 (9 self)
 Add to MetaCart
We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, highquality static and dynamic layout
Graph operations on Cayley graphs of semigroups
, 2014
"... Abstract Lots of large graphs can be constructed from existing smaller graphs by using graph operations, such as the graph products. Many properties of such large graphs are closely related to those of the corresponding smaller ones.In this paper we consider some operations of Cayley graphs on semi ..."
Abstract
 Add to MetaCart
Abstract Lots of large graphs can be constructed from existing smaller graphs by using graph operations, such as the graph products. Many properties of such large graphs are closely related to those of the corresponding smaller ones.In this paper we consider some operations of Cayley graphs
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 592 (12 self)
 Add to MetaCart
Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs
Reasoning with graph operations
 Proceedings of Workshop on Formal aspects of Semantic Networks, J.F. Sowa (Ed), Formal Aspects of Semantic Networks
, 1989
"... Problem solving is an analog to scientific method, wherein abduction and deduction operate in a cyclic fashion to generate and refine a series of hypotheses that purport to explain the observed data. Model Generative Reasoning implements this cycle through a family of operations on representations b ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
based on conceptual graphs. Specialize, the operator that implements abduction generates alternative hypotheses. Fragment removes potential incoherences from hypotheses, while preserving coherence with the observations. This is seen as a form of deduction with the aim of allowing more hypotheses
Graph Operations that are Good for Greedoids
"... S is a local maximum stable set of G, and we write S 2 (G), if S is a maximum stable set of the subgraph induced by S [ N(S), where N(S) is the neighborhood of S. Nemhauser and Trotter Jr. [5] proved that any S 2 (G) is a subset of a maximum stable set of G. In [1] we have proved that (G) is a greed ..."
Abstract
 Add to MetaCart
greedoid for every forest G. The cases of bipartite graphs and trianglefree graphs were analyzed in [2] and [3], respectively. If G has a perfect matching consisting of only pendant edges, then (G) forms a greedoid on its vertex set, i.e., (G) is a greedoid for every wellcovered graph G of girth at least
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Chromatic capacity and graph operations
"... The chromatic capacity χcap(G) of a graph G is the largest k for which there exists a kcoloring of the edges of G such that, for every coloring of the vertices of G with the same colors, some edge is colored the same as both its vertices. We prove that there is an unbounded function f: N → N such t ..."
Abstract
 Add to MetaCart
The chromatic capacity χcap(G) of a graph G is the largest k for which there exists a kcoloring of the edges of G such that, for every coloring of the vertices of G with the same colors, some edge is colored the same as both its vertices. We prove that there is an unbounded function f: N → N
Results 1  10
of
8,668