Pages that link to "Item:Q5902510"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902510):
Displaying 11 items.
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- (Q5126619) (← links)
- (Q5150424) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
