Results 1  10
of
1,127,170
A Linear Algorithm for the Connected Domination Problem on CircularArc Graphs
 PROC. OF THE 19TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... A connected domination set of a graph is a set D of vertices such that every vertex not in D is adjacent to at least one vertex in D, and the induced subgraph of D is connected. Given a circulararc graph G in arc model with n sorted arcs, we present an algorithm for finding a minimum connected domi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A connected domination set of a graph is a set D of vertices such that every vertex not in D is adjacent to at least one vertex in D, and the induced subgraph of D is connected. Given a circulararc graph G in arc model with n sorted arcs, we present an algorithm for finding a minimum connected
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1384 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
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.
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
Proper Helly CircularArc Graphs
"... A circulararc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circulararc model, if every arc has the same length then M is a unit circulararc model and if A satisfies the Helly Property then M is a Helly circularar ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
model. A (proper) (unit) (Helly) circulararc graph is the intersection graph of the arcs of a (proper) (Helly) circulararc model. Circulararc graphs and their subclasses have been the object of a great deal of attention in the literature. Linear time recognition algorithms have been described both
Power Domination in Circulararc Graphs
, 2005
"... A set S ⊆ V is a power dominating set (PDS) of a graph G = (V,E) if every vertex and every edge in G can be observed based on the observation rules of power system monitoring. The power domination problem involves minimizing the cardinality of a PDS of a graph. We consider this combinatorial optimiz ..."
Abstract
 Add to MetaCart
optimization problem and present a linear time algorithm for finding the minimum PDS of an interval graph if the interval ordering of the graph is provided. In addition, we show that the algorithm, which runs in Θ(n logn) time, where n is the number of intervals, is asymptotically optimal if the interval
On cliques of Helly Circulararc Graphs
"... A circulararc graph is the intersection graph of a set of arcs on the circle. It is a Helly circulararc graph if it has a Helly model, where every maximal clique is the set of arcs that traverse some clique point on the circle. A clique model is a Helly model that identifies one clique point for e ..."
Abstract
 Add to MetaCart
) time recognition algorithm for the clique graphs of Helly circulararc graphs. Next, we develop an O(n) time algorithm to obtain a clique model of Helly model, improving the previous O(n 2) bound. This gives a lineartime algorithm to find a proper Helly model for the clique graph of a Helly circulararc
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 549 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
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³).
Results 1  10
of
1,127,170