Results 1  10
of
2,143,360
rDomination Problems on Homogeneously Orderable Graphs
 Networks
, 1997
"... : In this paper, we consider r dominating cliques in homogeneously orderable graphs ( a common generalization of dually chordal and distancehereditary graphs ) and their relation to strict rpacking sets. We prove that a homogeneously orderable graph G possesses an r dominating clique if and onl ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
if and only if for any pair of vertices x , y of Gd(x,y)r(x)/r(y)/1 holds where r : V r # is a given vertex function. Furthermore, we show that for homogeneously orderable graphs with rdominating cliques the cardinality of a maximum strict rpacking set equals the cardinality of a minimum r dominating
rDomination problems on trees and their homogeneous extensions
, 1995
"... . A graph is a homogeneous extension of a tree iff the reduction of all homogeneous sets (sometimes called modules) to single vertices gives a tree. We show that these graphs can be recognized in linear sequential and polylogarithmic parallel time using modular decomposition. As an application of so ..."
Abstract
 Add to MetaCart
of some results on homogeneous sets we present a linear time algorithm computing the vertex sets of the connected components of the complement of an arbitrary graph. Moreover we present efficient parallel algorithms solving the problems rdominating set, r dominating clique and connected rdominating
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
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
) n 2 with 0 < α < 17 −3 (), and G has no book of size at least graph G1 of order at least
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 989 (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
HOMOGENIZATION AND TWOSCALE CONVERGENCE
, 1992
"... Following an idea of G. Nguetseng, the author defines a notion of "twoscale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector ..."
Abstract

Cited by 445 (14 self)
 Add to MetaCart
type theorem (i.e., which permits, in some cases, replacing a sequence by its "twoscale " limit, up to a strongly convergent remainder in L2(12)) is also established. These results are especially useful for the homogenization of partial differential equations with periodically oscillating
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
Results 1  10
of
2,143,360