Results 1  10
of
312,398
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
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
On the Cubicity of ATfree graphs and Circulararc graphs
, 2008
"... A unit cube in k dimensions (kcube) is defined as the the Cartesian product R1 × R2 × · · · × Rk where Ri(for 1 ≤ i ≤ k) is a closed interval of the form [ai, ai + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of kcubes (cube representation in k dim ..."
Abstract
 Add to MetaCart
free graphs, circulararc graphs and cocomparability graphs which have O(∆) bandwidth. Thus we have: 1. cub(G) ≤ 3 ∆ − 1, if G is an ATfree graph. 2. cub(G) ≤ 2 ∆ + 1, if G is a circulararc graph. 3. cub(G) ≤ 2∆, if G is a cocomparability graph. Also for these graph classes, there are constant factor
Minimum Fillin on Circle and CircularArc Graphs
 J. ALGORITHMS
, 1996
"... We present two algorithms solving the minimum fillin problem on circle graphs and on circulararc graphs in time O(n³). ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We present two algorithms solving the minimum fillin problem on circle graphs and on circulararc graphs in time O(n³).
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
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
Parallel Algorithms for Connected Domination Problem on Interval and Circulararc Graphs
"... Abstract: A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propo ..."
Abstract
 Add to MetaCart
propose parallel algorithms for finding the minimum connected domination set of interval graphs and circulararc graphs. Our algorithms run in time algorithm using processors while the intervals and arcs are given in sorted order. Our algorithms are on the EREW PRAM model.
Some Optimal Parallel Algorithms on Interval and Circulararc Graphs *
"... In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and ..."
Abstract
 Add to MetaCart
In this paper, we consider some shortest path related problems on interval and circulararc graphs. For the allpair shortest path query problem on interval and circulararc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix
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
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Helly CircularArc Graph Isomorphism Is in Logspace
"... Abstract. We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circulararc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Δ trees employed in McConnell ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circulararc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Δ trees employed in Mc
Pathwidth of circulararc graphs
 Proceedings of WG 2007, Lecture Notes in Computer Science 4769, 2007
"... Abstract. The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a wellknown and wellstudied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time. We give i ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
in this paper an O(n 2)time algorithm computing the pathwidth of circulararc graphs. 1
Results 1  10
of
312,398