Pages that link to "Item:Q2545884"
From MaRDI portal
The following pages link to Triangulated graphs and the elimination process (Q2545884):
Displaying 16 items.
- On strict-double-bound numbers of graphs and cut sets (Q5061697) (← links)
- (Q5091062) (← links)
- Two strikes against perfect phylogeny (Q5204323) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778) (← links)
- Minimal elimination ordering for graphs of bounded degree (Q5957302) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- A cop-winning strategy on strongly cop-win graphs (Q6041547) (← links)
- Chordal matroids arising from generalized parallel connections (Q6184905) (← links)
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs (Q6487434) (← links)
- Walk Domination and HHD-Free Graphs (Q6489357) (← links)
- Vine copula structure representations using graphs and matrices (Q6495088) (← links)
- Reduced clique graphs. A correction to: ``Chordal graphs and their clique graphs'' (Q6540643) (← links)
- Chordal graphs and distinguishability of quantum product states (Q6541336) (← links)
- Chordal matroids arising from generalized parallel connections. II (Q6665419) (← links)
