ScholarLens Back to search
1998•SIAM Journal on ComputingRequires access

Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

Wen−Lian Hsu, Tze-Heng Ma

Open publisher page 56 citations

Abstract

In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n 2 ) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved.

About this research paper

What this paper is about

In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n 2 ) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved.

Why it matters

OpenAlex reports 56 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n 2 ) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved.

Key concepts: Interval graph, Chordal graph, Comparability, Split graph, Indifference graph, Pathwidth, Algorithm, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs — Research Paper | ScholarLens