Pages that link to "Item:Q1095923"
From MaRDI portal
The following pages link to A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923):
Displaying 7 items.
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- The maximum clique problem (Q1318271) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
