Classifying rankwidth k-DH-graphs

Authors:
Ling-Ju Hung;Ton Kloks
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi, Taiwan;Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi, Taiwan
Venue:
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Year:
2010

Citing 5
Cited 0

Two-graphs and trees

Discrete Mathematics - Special issue on graph theory and applications
Dynamic Programming on Distance-Hereditary Graphs

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Graphs of bounded rank-width

Graphs of bounded rank-width
Kruskalian graphs k-cographs

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
On some simple widths

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let k be a natural number. A graph is k-distance hereditary if it has a tree-decomposition such that every cutmatrix has a block structure that is some submatrix of where Ik is the k ×k identity matrix. We characterize k-distance hereditary graphs and we show that for fixed k there exists an O(n3) time algorithm that recognizes the graphs in this class.