Pages that link to "Item:Q4285462"
From MaRDI portal
The following pages link to Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem (Q4285462):
Displaying 15 items.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Iterative proportional scaling via decomposable submodels for contingency tables (Q961221) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- The maximum clique problem (Q1318271) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- (Q6089669) (← links)