Results 1  10
of
184,817
An O(nm)time Certifying Algorithm for Recognizing HHDfree Graphs
"... In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHDfree graphs, i.e., graphs that do not contain any induced subgraph isomorphic to a house, a hole, or a domino. We prove properties of the HHDfree graphs which enable us to present an O(n m) ..."
Abstract
 Add to MetaCart
computation requires O(n + m) additional time and O(n) space. Keywords: HHDfree graphs, perfectly orderable graphs, certifying algorithms, recognition. 1
Recognizing HHDfree and WelshPowell Opposition Graphs
 Proc. 30th Int. Workshop on GraphTheoretic Concepts in Computer Science (WG’04), LNCS 3353
, 2004
"... In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHDfree and the WelshPowell opposition graphs (or WPOgraphs) . In particular, we prove properties and show that a modified version of the classic lineartime algorithm for testing for a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
perfect elimination ordering can be e#ciently used to determine in O(nm + n log n) time whether a given graph G on n vertices and m edges contains a house or a hole; this leads to an O(nm + n log n)time and O(n + m)space algorithm for recognizing HHDfree graphs. We also show that determining
Convexity and HHDFree Graphs
, 1999
"... It is well known that chordal graphs can be characterized via<F3.302e+05><F3.821e+05> mconvexity. In this paper we introduce the notion of<F3.302e+05> m<F2.785e+05> 3<F3.821e+05> convexity (a relaxation of<F3.302e+05><F3.821e+05> mconvexity) which is cl ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
is closely related to semisimplicial orderings of graphs. We present new characterizations of HHDfree graphs via<F3.302e+05> m<F2.785e+05> 3<F3.821e+05> convexity and obtain some results known from [B. Jamison and S. Olariu, Adv. Appl. Math., 9 (1988), pp. 364376] as corollaries
Recognizing HHfree, HHDfree, and WelshPowell Opposition Graphs
"... In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HHfree, the HHDfree, and the WelshPowell opposition graphs (or WPOgraphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic lin ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
)space algorithm for recognizing HHfree graphs, and in turn leads to an HHDfree graph recognition algorithm exhibiting the same time and space complexity. We also show that determining whether the complement G of the graph G is HHfree can be efficiently resolved in O(nm) time using O(n 2) space, which leads
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
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
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
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
Instancebased learning algorithms
 Machine Learning
, 1991
"... Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to ..."
Abstract

Cited by 1359 (18 self)
 Add to MetaCart
Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
, the difficulty of their construction and their potential size have discouraged their use. We present new algorithms that efficiently compute these data structures for arbitrary control flow graphs. The algorithms use dominance frontiers, a new concept that may have other applications. We also give analytical
Results 1  10
of
184,817