A Graph-Based Approach to Power-Constrained SOC Test Scheduling
Journal of Electronic Testing: Theory and Applications
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
An implicit representation of chordal comparability graphs in linear time
Discrete Applied Mathematics
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Linear-Time algorithms for tree root problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
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(n2) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved.