Laminar structure of ptolemaic graphs and its applications
スポンサーリンク
概要
- 論文の詳細を見る
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs, and it is a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a laminar structure of cliques, and leads us to a canonical tree representation, which gives a simple intersection model for ptolemaic graphs. The tree representation is constructed in linear time from a perfect elimination ordering obtained by the lexicographic breadth first search. Hence the recognition and the graph isomorphism for ptolemaic graphs can be solved in linear time. Using the tree representation, we also give an O(n) time algorithm for the Hamiltonian cycle problem.
- SPRINGER-VERLAGの論文
- 2005-00-00
SPRINGER-VERLAG | 論文
- Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
- Development of Taenia saginata asiatica metacestodes in SCID mice and its infectivity in human and alternative definitive hosts
- Effects of fire-derived charcoal on soil properties and seedling regeneration in a recently burned Larix gmelinii/Pinus sylvestris forest
- Carbon dioxide insufflation during endoscopic retrograde cholangiopancreatography reduces bowel gas volume but does not affect visual analogue scale scores of suffering: a prospective, double-blind, randomized, controlled trial
- Diversity of Freshwater Thioploca Species and Their Specific Association with Filamentous Bacteria of the Phylum Chloroflexi