One-phase algorithm for the determination of minimal vertex separators of chordal graphs
From MaRDI portal
Publication:3002552
DOI10.1111/j.1475-3995.2009.00751.xzbMath1220.90151OpenAlexW2124895386MaRDI QIDQ3002552
Paulo Renato da Costa Pereira, Lilian Markenzon
Publication date: 20 May 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00751.x
Related Items
The scattering number of strictly chordal graphs: linear time determination ⋮ Strictly interval graphs: characterization and linear time recognition ⋮ Ptolemaic and planar cover-incomparability graphs ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Strictly chordal graphs: structural properties and integer Laplacian eigenvalues ⋮ Counting and enumerating unlabeled split–indifference graphs ⋮ An efficient representation of chordal graphs ⋮ Integer Laplacian eigenvalues of chordal graphs ⋮ New results on Ptolemaic graphs ⋮ Vulnerability of subclasses of chordal graphs ⋮ Non-inclusion and other subclasses of chordal graphs ⋮ Block-indifference graphs: characterization, structural and spectral properties ⋮ k-separator chordal graphs: leafage and subfamilies
Cites Work
- A linear time algorithm to list the minimal separators of chordal graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Minimal vertex separators of chordal graphs
- The existence of homeomorphic subgraphs in chordal graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- On simple characterizations of k-trees
- Algorithmic graph theory and perfect graphs
- Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees
- Subclasses of \(k\)-trees: characterization and recognition
This page was built for publication: One-phase algorithm for the determination of minimal vertex separators of chordal graphs
