Results 1  10
of
56,685
The Clique Operator on CircularArc Graphs
, 2009
"... A circulararc graph G is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is Helly when the arcs satisfy the Helly Property, while the model is proper Helly ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
when it is simultaneously proper and Helly. A graph admitting a Helly (resp. proper Helly) model is called a Helly (resp. proper Helly) circulararc graph. The clique graph K(G) of a graph G is the intersection graph of its cliques. The iterated clique graph K i (G) of G is defined by K 0 (G) = G
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
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
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
Clique graphs of Helly circulararc graphs
 Ars Combinatoria
"... Abstract: Clique graphs of several classes of graphs have been already characterized. Trees, interval graphs, chordal graphs, block graphs, cliqueHelly graphs are some of them. However, no characterization of clique graphs of circulararc graphs and some of their subclasses is known. In this paper, ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Abstract: Clique graphs of several classes of graphs have been already characterized. Trees, interval graphs, chordal graphs, block graphs, cliqueHelly graphs are some of them. However, no characterization of clique graphs of circulararc graphs and some of their subclasses is known. In this paper
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
k Best Cuts for CircularArc Graphs
, 1997
"... Given a set of n nonnegative weighted circulararcs on a unit circle, and an integer k, the k Best Cuts for CircularArcs problem, abbreviated as kBCCA problem, is to find a placement of k points, called cuts, on the circle such that the total weight of the arcs that contain at least one cut is ma ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
be improved to O(n). Based on these results, we then show that the kBCCA problem can be solved in O(I(k; n) + n log n) time, where I(k; n) is the time complexity of the kBCI problem. As a byproduct, the k Maximum Cliques Cover problem, (k ? 1) for the circulararc graphs can be solved in O(I(k; n) + n
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Interval Routing Schemes for CircularArc Graphs
, 2012
"... Interval routing is a space efficient method to realize a distributed routing function. In this paper, we show that every circulararc graph allows a shortest path strict 2interval routing scheme, i.e., a routing function that only implies shortest paths can be realized in every circulararc graph, ..."
Abstract
 Add to MetaCart
Interval routing is a space efficient method to realize a distributed routing function. In this paper, we show that every circulararc graph allows a shortest path strict 2interval routing scheme, i.e., a routing function that only implies shortest paths can be realized in every circulararc graph
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
Results 1  10
of
56,685