Results 1  10
of
184
Approximating cliquewidth and branchwidth
 JOURNAL OF COMBINATORIAL THEORY, SERIES B
, 2006
"... We construct a polynomialtime algorithm to approximate the branchwidth of certain symmetric submodular functions, and give two applications. The first is to graph “cliquewidth”. Cliquewidth is a measure of the difficulty of decomposing a graph in a kind of treestructure, and if a graph has cl ..."
Abstract

Cited by 114 (15 self)
 Add to MetaCart
(Show Context)
We construct a polynomialtime algorithm to approximate the branchwidth of certain symmetric submodular functions, and give two applications. The first is to graph “cliquewidth”. Cliquewidth is a measure of the difficulty of decomposing a graph in a kind of treestructure, and if a graph has cliquewidth at most k then the corresponding decomposition of the graph is called a “kexpression”. We find (for fixed k) an O(n 9 log n)time algorithm that, with input an nvertex graph, outputs either a (2 3k+2 − 1)expression for the graph, or a true statement that the graph has cliquewidth at least k + 1. (The best earlier algorithm algorithm, by Johansson [13], constructed a k log nexpression for graphs of cliquewidth at most k.) It was already known that several graph problems, NPhard on general graphs, are solvable in polynomial time if the input graph comes equipped with a kexpression (for fixed k). As a consequence of our algorithm, the same conclusion follows under the weaker hypothesis that the input graph has cliquewidth at most k (thus, we no longer need to be provided with an explicit kexpression). Another application is to the area of matroid branchwidth. For fixed k, we find an O(n 4)time algorithm that, with input an nelement matroid in terms of its rank oracle, either outputs a branchdecomposition of width at most 3k − 1 or a true statement that the matroid has branchwidth at least k + 1. The previous algorithm by Hliněn´y [11] was only for representable matroids.
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 111 (12 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.
The L(2,1)Labeling Problem on Graphs
, 1993
"... An L(2; 1)labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that jf(x) 0 f(y)j 2 if d(x; y) = 1 and jf(x) 0 f(y)j 1 if d(x; y) = 2. The L(2; 1)labeling number (G) of G is the smallest number k such that G has a L(2; 1)labeling with max ..."
Abstract

Cited by 107 (2 self)
 Add to MetaCart
An L(2; 1)labeling of a graph G is a function f from the vertex set V (G) to the set of all nonnegative integers such that jf(x) 0 f(y)j 2 if d(x; y) = 1 and jf(x) 0 f(y)j 1 if d(x; y) = 2. The L(2; 1)labeling number (G) of G is the smallest number k such that G has a L(2; 1)labeling with maxff(v) : v 2 V (G)g = k. In this paper, we give exact formulas of (G[H) and (G+H). We also prove that (G) 1 2 +1 for any graph G of maximum degree 1. For OSFchordal graphs, the upper bound can be reduced to (G) 21+ 1. For SFchordal graphs, the upper bound can be reduced to (G) 1+ 2Ø(G) 0 2. Finally, we present a polynomial time algorithm to determine (T ) for a tree T.
Pattern Matching For Permutations
, 1993
"... Given a permutation T of 1 to n, and a permutation P of 1 to k, for k n, we wish to find a kelement subsequence of T whose elements are ordered according to the permutation P . ..."
Abstract

Cited by 76 (0 self)
 Add to MetaCart
Given a permutation T of 1 to n, and a permutation P of 1 to k, for k n, we wish to find a kelement subsequence of T whose elements are ordered according to the permutation P .
Upper bounds to the clique width of graphs
, 2000
"... Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear complexity on graphs with treedecompositions of bounded width. We investigate alternate hierarchical decompositions that apply to wider classes of graphs and still enjoy good algori ..."
Abstract

Cited by 69 (6 self)
 Add to MetaCart
Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear complexity on graphs with treedecompositions of bounded width. We investigate alternate hierarchical decompositions that apply to wider classes of graphs and still enjoy good algorithmic properties. These decompositions are motivated and inspired by the study of vertexreplacement contextfree graph grammars. The complexity measure of graphs associated with these decompositions is called clique width. In this paper we bound the clique width of a graph in terms of its tree width on the one hand, and of the clique width of its edge
Graph Sandwich Problems
, 1994
"... The graph sandwich problem for property \Pi is defined as follows: Given two graphs G ) such that E ` E , is there a graph G = (V; E) such that E which satisfies property \Pi? Such problems generalize recognition problems and arise in various applications. Concentrating mainly o ..."
Abstract

Cited by 68 (8 self)
 Add to MetaCart
The graph sandwich problem for property \Pi is defined as follows: Given two graphs G ) such that E ` E , is there a graph G = (V; E) such that E which satisfies property \Pi? Such problems generalize recognition problems and arise in various applications. Concentrating mainly on properties characterizing subfamilies of perfect graphs, we give polynomial algorithms for several properties and prove the NPcompleteness of others. We describe
Upper Bounds to the CliqueWidth of Graphs
 Discrete Applied Mathematics
, 1997
"... A graph complexity measure that we call cliquewidth is associated in a natural way with certain graph decompositions, more or less like treewidth is associated with treedecomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewe ..."
Abstract

Cited by 67 (16 self)
 Add to MetaCart
A graph complexity measure that we call cliquewidth is associated in a natural way with certain graph decompositions, more or less like treewidth is associated with treedecomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewed as a finite term, written with appropriate operations on graphs, that evaluates to G. Infinitely many operations are necessary to define all graphs. By limiting the operations in terms of some integer parameter k, one obtains complexity measures of graphs. Specifically, a graph G has complexity at most k iff it has a decomposition defined in terms of k operations. Hierarchical graph decompositions are interesting for algorithmic purposes. In fact, many NPcomplete problems have linear algorithms on graphs of treewidth or of cliquewidth bounded by some fixed k, and the same will hold for graphs of cliquewidth at most k. The graph operations upon which cliquewidth and the related decomp...
Finding Branchdecomposition and Rankdecomposition
 SIAM J. Comput
"... We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branchdecomposition of width at most k if such exists. This algorithm works also ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
(Show Context)
We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branchdecomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixedparameter tractable, that is, they run in time O(n3) where n is the number of vertices / elements of the input, for each constant value of k and any fixed finite field. The previous best algorithm for construction of a branchdecomposition or a rankdecomposition of optimal width due to Oum and Seymour [Testing branchwidth. J. Combin. Theory Ser. B, 97(3) (2007) 385–393] is not fixedparameter tractable.
Certifying algorithms for recognizing interval graphs and permutation graphs
 SIAM J. COMPUT
, 2006
"... A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is a piece of evidence that proves that the answer has not been compromised by a bug in the implementation. We give lineartime certifying algorithms for recognition o ..."
Abstract

Cited by 44 (8 self)
 Add to MetaCart
(Show Context)
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is a piece of evidence that proves that the answer has not been compromised by a bug in the implementation. We give lineartime certifying algorithms for recognition of interval graphs and permutation graphs, and for a few other related problems. Previous algorithms fail to provide supporting evidence when they claim that the input graph is not a member of the class. We show that our certificates of nonmembership can be authenticated in O(V) time.
Precoloring extension. III. Classes of perfect graphs
"... We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some classes of perfect graphs, giving good characterizations (necessary and sufficient conditions) that lead to algorithms with linear or polynomial running time. It is also shown how a larger subclass of perfect graphs can be derived from graphs containing no induced path on four vertices.