Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

WG
2004
Springer

favoriteEmaildiscussreport

107views Theoretical Computer Science» more WG 2004»

Treelike Comparability Graphs: Characterization, Recognition, and Applications

14 years 4 months ago

Treelike Comparability Graphs: Characterization, Recognition, and Applications

Download www.inf.uni-konstanz.de

An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs are distance hereditary. Utilizing this property, we give a linear time recognition algorithm. We then characterize permutation graphs that are treelike. Finally, we consider the Partitioning into Bounded Cliques problem on special subgraphs of treelike permutation graphs.

Sabine Cornelsen, Gabriele Di Stefano

Real-time Traffic

Computer Science | Permutation Graphs | Treelike Comparability Graphs | Treelike Permutation Graphs | WG 2004 |

claim paper

Related Content

» The Simultaneous Representation Problem for Chordal Comparability and Permutation Graphs

» Graph Matching Based on Node Signatures

» A Face Recognition System Based on Local Feature Analysis

» Recognition of island structures for map generalization

» Attributed Graph Matching Using Local Descriptions

» Comparing SIFT descriptors and gabor texture features for classification of remote sensed ...

» A LinearTime Graph Kernel

» Face Description with Local Invariant Features Application to Face Recognition

» A Binary Linear Programming Formulation of the Graph Edit Distance

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Sabine Cornelsen, Gabriele Di Stefano

Comments (0)