Graph Operations on Clique-Width Bounded Graphs
Frank Gurski
TL;DR
This paper investigates how clique-width and NLC-width parameters of graphs change under various operations and transformations, providing bounds that help understand their computational complexity implications.
Contribution
It offers new bounds on clique-width and NLC-width after graph modifications, enhancing understanding of their behavior in complex graph operations.
Findings
Bounds for clique-width after graph operations
Bounds for NLC-width after graph transformations
Insights into computational complexity of graph problems
Abstract
Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width and NLC-width under various graph operations and graph transformations. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Interconnection Networks and Systems