Pages that link to "Item:Q5283388"
From MaRDI portal
The following pages link to Linear-Time Generation of Random Chordal Graphs (Q5283388):
Displaying 4 items.
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Algorithms for generating strongly chordal graphs (Q2233439) (← links)
- A separator-based method for generating weakly chordal graphs (Q5858151) (← links)
