Results 1  10
of
12
Modular Decomposition and Transitive Orientation
, 1999
"... A module of an undirected graph is a set X of nodes such for each node x not in X, either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canonical linearspace representation for the modules of a graph, called the modular decomposition. Closely related to modular ..."
Abstract

Cited by 90 (14 self)
 Add to MetaCart
A module of an undirected graph is a set X of nodes such for each node x not in X, either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canonical linearspace representation for the modules of a graph, called the modular decomposition. Closely related to modular decomposition is the transitive orientation problem, which is the problem of assigning a direction to each edge of a graph so that the resulting digraph is transitive. A graph is a comparability graph if such an assignment is possible. We give O(n +m) algorithms for modular decomposition and transitive orientation, where n and m are the number of vertices and edges of the graph. This gives linear time bounds for recognizing permutation graphs, maximum clique and minimum vertex coloring on comparability graphs, and other combinatorial problems on comparability graphs and their complements.
LinearTime Recognition of CircularArc Graphs
 Algorithmica
, 2003
"... A graph G is a circulararc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect. We give a lineartime algorithm for recognizing this class of graphs. W ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
A graph G is a circulararc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if the corresponding arcs intersect. We give a lineartime algorithm for recognizing this class of graphs. When G is a member of the class, the algorithm gives a certificate in the form of a set of arcs that realize it.
PC trees and circularones arrangements
 Theoretical Computer Science
"... A 01 matrix has the consecutiveones property if its columns can be ordered so that the ones in every row are consecutive. It has the circularones property if its columns can be ordered so that, in every row, either the ones or the zeros are consecutive. PQ trees are used for representing all cons ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
A 01 matrix has the consecutiveones property if its columns can be ordered so that the ones in every row are consecutive. It has the circularones property if its columns can be ordered so that, in every row, either the ones or the zeros are consecutive. PQ trees are used for representing all consecutiveones orderings of the columns of a matrix that has the consecutiveones property. We give an analogous structure, called a PC tree, for representing all circularones orderings of the columns of a matrix that has the circularones property. No such representation has been given previously. In contrast to PQ trees, PC trees are unrooted. We obtain a much simpler algorithm for computing PQ trees that those that were previously available, by adding a zero column, x, to a matrix, computing the PC tree, and then picking the PC tree up by x to root it. 1
Efficient and practical algorithms for sequential modular decomposition
, 1999
"... A module of an undirected graph G = (V, E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O(n + m(m;n)) time bound and a variant with a linear time bou ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
A module of an undirected graph G = (V, E) is a set X of vertices that have the same set of neighbors in V \ X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O(n + m(m;n)) time bound and a variant with a linear time bound.
Construction of Probe Interval Models
"... An interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each pair of intersecting intervals. A probe interval graph is obtained from an interval graph by designating a subset P of vertices as probes, and removing the edges between pairs of vertice ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
An interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each pair of intersecting intervals. A probe interval graph is obtained from an interval graph by designating a subset P of vertices as probes, and removing the edges between pairs of vertices in the remaining set N of nonprobes. We examine the problem of finding and representing possible layouts of the intervals, given a probe interval graph. We obtain an O(n + m log n) bound, where n is the number of vertices and m is the number of edges. The problem is motivated by an application to molecular biology.
Algebraic recognizability of languages
 In Proc. 29th Int. Symp. Math. Found. of Comp. Sci. (MFCS’04
, 2004
"... Abstract. Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract. Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. In the beginning was the Word... Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. The notion of recognizable languages is a familiar one, associated with classical theorems by Kleene, Myhill, Nerode, Elgot, Büchi, Schützenberger, etc. It can be approached from several angles: recognizability by automata, recognizability by finite monoids or finiteindex congruences, rational expressions, monadic second
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2Structures
 ALGORITHMICA
, 1995
"... This paper gives an O(n²) incremental algorithm for computing the modular decomposition of 2structure [1, 2]. A 2structure is a type of edgecolored graph, and its modular decomposition is also known as the prime tree family. Modular decomposition of 2structures arises in the study of relational ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper gives an O(n²) incremental algorithm for computing the modular decomposition of 2structure [1, 2]. A 2structure is a type of edgecolored graph, and its modular decomposition is also known as the prime tree family. Modular decomposition of 2structures arises in the study of relational systems. The modular decomposition of undirected graphs and digraphs is a special case, and has applications in a number of combinatorial optimization problems. This algorithm generalizes elements of a previous O(n²) algorithm of Muller and Spinrad [3] for the decomposition of undirected graphs. However, Muller and Spinrad's algorithm employs a sophisticated data structure that impedes its generalization to digraphs and 2structures, and limits its practical use. We replace this data structure with a scheme that labels each edge with at most one node, thereby obtaining an algorithm that is both practical and general to 2structures.
Partially Complemented Representations of Digraphs
, 1999
"... this paper, we explore algorithmic uses of this concept on graphs and digraphs. An outward complementation operation is where only the outgoing arcs of a vertex are complemented. That is, the neighbors of the vertex are turned into nonneighbors and the nonneighbors are turned into neighbors. An in ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
this paper, we explore algorithmic uses of this concept on graphs and digraphs. An outward complementation operation is where only the outgoing arcs of a vertex are complemented. That is, the neighbors of the vertex are turned into nonneighbors and the nonneighbors are turned into neighbors. An inward complementation operations is where only the inward arcs are complemented. A symmetric complementation operation is one where both the inward and the outward arcs are complemented.