Journal of Combinatorial Theory Series B
Distance-hereditary graphs, Steiner trees, and connected domination
SIAM Journal on Computing
Discrete Applied Mathematics - Computational combinatiorics
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Graph classes: a survey
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
Domination in distance-hereditary graphs
Discrete Applied Mathematics
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Efficient generation of plane trees
Information Processing Letters
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Dynamic Programming on Distance-Hereditary Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
Simple geometrical intersection graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
| Hi-index | 0.01 |
Distance-hereditary graphs consist of the isometric graphs, and hence contain trees and cographs. First, a canonical and compact tree representation of the class is proposed. The tree representation can be constructed in linear time using two prefix trees. Usually, the prefix trees are used to maintain a set of strings. The prefix trees in our algorithm are used to maintain the neighbors for each vertex, which is new approach comparing to the other known results based on the lexicographically bread first search. Several efficient algorithms for the distancehereditary graphs based on the canonical tree representation are proposed; linear time algorithms for graph recognition and graph isomorphism, and efficient enumeration algorithm. An efficient coding for the tree representation is also presented, which requires 4n bits for a distance-hereditary graph of n vertices, and 3n bits for a cograph. The results improve previously known upper bounds of the number of distance-hereditary graphs and cographs.