Skip to main content
SpringerLink
Log in

Compact Representation of Graphs of Small Clique-Width

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The notion of clique-width for graphs offers many research topics and has received considerable attention in the past decade. A graph has clique-width k if it can be represented as an algebraic expression on k labels associated with its vertices. Many computationally hard problems can be solved in polynomial time for graphs of bounded clique-width. Interestingly also, many graph families have bounded clique-width. In this paper, we consider the problem of preprocessing a graph of size n and clique-width k to build space-efficient data structures that support basic graph navigation queries. First, by way of a counting argument, which is of interest in its own right, we prove the space requirement of any representation is \(\varOmega (kn)\). Then we present a navigation oracle which answers adjacency query in constant time and neighborhood queries in constant time per neighbor. This oracle uses O(kn) space (i.e., O(kn) bits). We also present a degree query which reports the degree of each given vertex in \(O(k\log ^*(n))\) time using \(O(kn \log ^*(n))\) bits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. Algorithmica 62(1–2), 224–257 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Barbay, J., Gagie, T., Navarro, G., Nekrich, Y.: Alphabet partitioning for compressed rank/select and applications. In: Proceedings of 21st International Symposium on Algorithms and Computation (ISAAC), pp. 315–326. (2010)

  3. Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: Proceedings of 14th Symposium on Discrete Algorithms (SODA), pp. 679–688. (2003)

  4. Blelloch, G.E., Farzan, A.: Succinct representations of separable graphs. In: Proceedings of 21st Combinatorial Pattern Matching Conference (CPM), pp. 138–150. (2010)

  5. Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34(4), 825–847 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1–3), 77–114 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Appl. Math. 131(1), 129–150 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Farzan, A.: Succinct representation of trees and graphs. PhD thesis, School of Computer Science, University of Waterloo, (2009)

  10. Farzan, A., Fischer, J.: Compact representation of posets. In: Proceedings of 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 302–311. (2011)

  11. Farzan, A., Kamali, S.: Compact navigation and distance oracles for graphs with small treewidth. Algorithmica 69(1), 92–116 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Farzan, A., Munro, J.I.: A uniform paradigm to succinctly encode various families of trees. Algorithmica 68(1), 16–40 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11(3), 423–443 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Golynski, A., Munro, J.I., Srinivasa Rao, S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proceedings of 17th Symposium on Discrete Algorithms (SODA), pp. 368–373. (2006)

  15. Kaminski, M., Lozin, V.V., Milanic, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747–2761 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Meer, K., Rautenbach, D.: On the OBDD size for graphs of bounded tree- and clique-width. Discrete Math. 309(4), 843–851 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Munro, J.I.: Succinct data structures. Electr. Notes Theor. Comput. Sci. 91, 3 (2004)

    Article  Google Scholar 

  18. Munro, J.I., Nicholson, P.K.: Succinct posets. Algorithmica 76(2), 445–473 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  19. Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 16:1–16:39 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Spinrad, J.P.: Efficient Graph Representations. The Fields Institute for Research in Mathematical Sciences, Toronto (2003)

    Book  MATH  Google Scholar 

  21. Vanherpe, J.-M.: Clique-width of partner-limited graphs. Discrete Math. 276(1–3), 363–374 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Witten, I.H., Moffat, A., Bell, Timothy C.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann Publishers Inc., Burlington (1999)

    MATH  Google Scholar 

Download references

Acknowledgements

The author would like to thank the anonymous reviewers for their careful reading of the paper and for their valuable comments and suggestions which resulted in substantial improvement of the paper.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada

    Shahin Kamali

Authors
  1. Shahin Kamali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahin Kamali.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamali, S. Compact Representation of Graphs of Small Clique-Width. Algorithmica 80, 2106–2131 (2018). https://doi.org/10.1007/s00453-017-0365-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-017-0365-6

Keywords

Search

Navigation