Computational Complexity of the Krausz Dimension of Graphs
نویسندگان
چکیده
A Krausz partition of a graph G is a partition of the edges of G into complete subgraphs. The Krausz dimension of a graph G is the least number k such that G admits a Krausz partition in which each vertex belongs to at most k classes. The graphs with Krausz dimension at most 2 are exactly the line graphs, and graphs of the Krausz dimension at most k are intersection graphs of k-uniform linear hypergraphs. This paper studies the computational complexity of the Krausz dimension problem. We show that deciding if Krausz dimension of a graph is at most 3 is NP-complete in general, but solvable in polynomial time for graphs of maximum degree 4. We pay closer attention to chordal graphs, showing that deciding if Krausz dimension is at most 6 is NP-complete for chordal graphs in general, while the Krausz dimension of a chordal graph with bounded clique size can be determined in polynomial time. We also show that for any xed k, it can be decided in polynomial time if an interval graph has Krausz dimension at most k.
منابع مشابه
Krausz dimension and its generalizations in special graph classes
In this paper we prove, that the problem ”kdim(G) ≤ 3” is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the problem of finding m-krausz dimension is NP-hard for every m ≥ 1, even if restricted to (1,2)-colorable graphs, but the problem ”kdimm(G) ≤ k” is polynomially solvable for (∞, 1)-polar graphs for every fixed k,m...
متن کاملرفع نوفه ویدئو توسط تبدیل قیچک قطعهای
Parabolic scaling and anisotropic dilation form the core of famous multi-resolution transformations such as curvelet and shearlet, which are widely used in signal processing applications like denoising. These non-adaptive geometrical wavelets are commonly used to extract structures and geometrical features of multi-dimensional signals and preserve them in noise removal treatments. In discrete s...
متن کاملOn the Complexity of Metric Dimension
The metric dimension of a graph G is the size of a smallest subset L ⊆ V (G) such that for any x, y ∈ V (G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric dimension of a graph is still very unclear. Es...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کامل