scientific article

zbMath0764.68134MaRDI QIDQ4035766

Klaus Simon

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cliquesinterval graphslexicographic breadth first searchperfect elimination scheme\(PQ\)-tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs ⋮ A new LBFS-based algorithm for cocomparability graph recognition ⋮ Graph searches and their end vertices ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition ⋮ Unnamed Item ⋮ A new graph parameter to measure linearity ⋮ Fully dynamic representations of interval graphs ⋮ A linear-time algorithm for proper interval graph recognition ⋮ On end-vertices of lexicographic breadth first searches ⋮ A Lex-BFS-based recognition algorithm for Robinsonian matrices ⋮ A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

This page was built for publication: