The following pages link to Maximal chordal subgraphs (Q1115455):
Displaying 17 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Maximal chains of isomorphic subgraphs of the Rado graph (Q485527) (← 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)
- On the complexity of some subgraph problems (Q967414) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- (Q3035321) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007) (← links)
- A note on the size of a chordal subgraph (Q3791176) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
