Generating and characterizing the perfect elimination orderings of a chordal graph
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Information Processing Letters
Minimal separators in extended P4-laden graphs
Discrete Applied Mathematics
Hi-index | 0.05 |