Counting clique trees and computing perfect elimination schemes in parallel
Information Processing Letters
A fast algorithm for reordering sparse matrices for parallel factorization
SIAM Journal on Scientific and Statistical Computing
Triangulating graphs without asteroidal triples
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Listing all Minimal Separators of a Graph
SIAM Journal on Computing
Separability generalizes Dirac's theorem
Discrete Applied Mathematics
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics
How to Use the Minimal Separators of a Graph for its Chordal Triangulation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
| Hi-index | 0.04 |
We introduce a new type of order of sets of vertices. Using this concept, we describe the structure and the relationship between chordal, interval, cocomparability, and asteriodal triple-free graphs.