Results 1  10
of
648,596
Bandwidth on ATfree graphs
, 2009
"... We study the classical Bandwidth problem from the viewpoint of parameterized algorithms. In the Bandwidth problem we are given a graph G = (V, E) together with a positive integer k, and asked whether there is an bijective function β: {1,..., n} → V such that for every edge uv ∈ E, β −1 (u) − β − ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is fixed parameter tractable (FPT), that is, solvable in time f(k)n O(1) for some function f. In this paper we present an algorithm with running time 2 O(k log k) n 2 for Bandwidth on ATfree graphs, a wellstudied graph class that contains interval, permutation, and cocomparability graphs. Our result
Approximating the treewidth of ATfree graphs
 Disc. Appl. Math
, 2003
"... . Using the specic structure of the minimal separators of ATfree graphs, we give a polynomial time algorithm that computes a triangulation whose width is no more than twice the treewidth of the input graph. 1 Introduction The treewidth of graphs, introduced by Robertson and Seymour [12], has been ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. Using the specic structure of the minimal separators of ATfree graphs, we give a polynomial time algorithm that computes a triangulation whose width is no more than twice the treewidth of the input graph. 1 Introduction The treewidth of graphs, introduced by Robertson and Seymour [12], has been
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
the first step. We give an O(bw · n) algorithm to compute the cube representation of a general graph G in bw +1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(∆) upper bounds on the cubicity of many wellknown graph classes such as ATfree
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
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
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
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
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
Secure Group Communications Using Key Graphs
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 552 (17 self)
 Add to MetaCart
management. We formalize the notion of a secure group as a triple (U; K;R) where U denotes a set of users, K a set of keys held by the users, and R a userkey relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely
Results 1  10
of
648,596