Abstract
Graphs of clique-width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we show that the (q,q-4) graphs are of clique width at most q and P 4-tidy graphs are of clique-width at most 4. Furthermore, the k-expression (for k=4 or k=q) associated with such a graph can be found in linear time.
q,q-4) graphs were introduced by Babel and Olariu (1995) and extends the class of P 4-sparse graphs. P 4-sparse graphs were introduced by Hoàng (1985) and are widely studied because of their applications in areas such as scheduling, clustering and computational semantics. Another extension of P 4-sparse graphs are the P 4-tidy graphs which were introduced by Rusu (1995).
Furthermore, we show that the class of LinEMSOL(τ 1,L) optimization problems is solvable in O(f(|V|,|E|)) time on a class of graphs of clique-width at most k in which for every graph G an expression defining it can be constructed in O(f(|V|,|E|)) time. By the above this applies in particular to (q,q – 4) graphs, P 4-tidy graphs and P 4-sparse graphs with f linear.
Finally, we show that the above results cannot be extended to MSOL(τ 2) decision and optimization problems on the vocabulary τ 2 which allow edges to be considered as elements of the domains of the graphs in question, and by that, allow quantifying over edges in addition to quantifying over vertices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
Buer, H., Möhring, R.H.: A fast algorithm for the decomposition of graphs and posets. Math. Oper. Res. 8, 170–184 (1983)
Babel, L., Olariu, S.: On the isomorphism of graphs with few P 4s. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 24–36. Springer, Heidelberg (1995)
Babel, L., Olariu, S.: Domination and steiner tree problems on graphs with few P4’s. In: Hromkovič, J., Sýkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 337–350. Springer, Heidelberg (1998)
Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)
Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. LNCS, vol. 787, pp. 68–84 (1994)
Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science 109, 49–82 (1993)
Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs (submitted for publication), http://dept-info.labri.u-bordeaux.fr/courcell/ActSci.html
Courcelle, B.: The monadic second-order logic of graphs i: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)
Courcelle, B.: The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoret. Comput. Sci. 80, 153–202 (1991)
Courcelle, B.: The monadic second-order logic of graphs VI: On several representations of graphs by relational structures. Disc. Appl. Math. 54, 117–149 (1994)
Courcelle, B.: The monadic second-order logic of graphs VIII: Orientations. Annals Pure Applied Logic 72, 103–143 (1995)
Courcelle, B.: The monadic second-order logic of graphs X: Linear orders. Theoret. Comput. Sci. 160, 87–143 (1996)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformations. Foundations, Ch. 5, vol. 1, pp. 313–400. World Scientific, Singapore (1997)
Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)
Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae 49, 129–141 (1961)
Fagin, R.: Generalized first-order spectra and polynomial time recognizable sets. American Math. Society Proc. 7, 27–41 (1974)
Feferman, S.: Some recent work of Ehrenfeucht and Fraïssé. In: Proceedings of the Summer Institute of Symbolic Logic, Ithaca, pp. 201–209 (1957)
Feferman, S., Vaught, R.: The first order properties of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)
Garey, M.G., Johnson, D.S.: Computers and Intractability. Mathematical Series. W.H. Freeman and Company, New York (1979)
Giakoumakis, V., Roussel, F., Thuillier, H.: On P4-tidy graphs. Discrete Mathematics and Theoretical Computer Science 1, 17–41 (1997)
Gurevich, Y.: Modest theory of short chains. I. Journal of Symbolic Logic 44, 481–490 (1979)
Gurevich, Y.: Monadic second order theories. In: Model-Theoretic Logics, Perspectives in Mathematical Logic, Ch. 14. Springer, Heidelberg (1985)
Giakoumakis, V., Vanherpe, J.: On extended P 4-reducible and extended P4-sparse graphs. Theoret. Comput. Sci. 180, 269–286 (1997)
Hoàng, C.: Doctoral thesis. McGill University, Montreal (1985)
Jamison, B., Olariu, S.: P4-reducible graphs a class of tree representable graphs. Studies Appl. Math. 81, 79–87 (1989)
Jamison, B., Olariu, S.: A linear-time recognition algorithm for P4-sparse graphs. SIAM J. Comput. 21, 381–406 (1992)
Jamison, B., Olariu, S.: A unique tree representation for P4-sparse graphs. Discrete Appl. Math. 35, 115–129 (1992)
Jamison, B., Olariu, S.: A linear-time algorithm to recognize P4-reducible graphs. Theoret. Comput. Sci. 145, 329–344 (1995)
Jamison, B., Olariu, S.: Linear-time optimization algorithms for P4-sparse graphs. Discrete Appl. Math. 61, 155–175 (1995)
Läuchli, H.: A decision procedure for the weak second order theory of linear order. In: Logic Colloquium 1966, pp. 189–197. North Holland, Amsterdam (1968)
Lautemann, C.: CSL 1992. LNCS, vol. 702, pp. 327–339. Springer, Heidelberg (1993)
Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)
Rotics, U.: Efficient Algorithms for Generally Intractable Graph Problems Restricted to Specific Classes of Graphs. PhD thesis, Technion- Israel Institute of Technology (1998)
Shelah, S.: The monadic theory of order. Annals of Mathematics 102, 379–419 (1975)
Spinrad, J.: P4 -trees and substitution decomposition. Discrete Appl. Math. 39, 263–291 (1992)
Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54, 251–266 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B., Makowsky, J.A., Rotics, U. (1998). Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_1
Download citation
DOI: https://doi.org/10.1007/10692760_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive