Pages that link to "Item:Q1333327"
From MaRDI portal
The following pages link to Chordal completions of planar graphs (Q1333327):
Displaying 22 items.
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Chords of longest circuits in locally planar graphs (Q854834) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Enumeration of chordal planar graphs and maps (Q2092390) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Searching for better fill-in (Q2453556) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Chordal completions of grids and planar graphs (Q3138285) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- (Q5490487) (← links)
- (Q5743514) (← links)
- A biased random-key genetic algorithm for the chordal completion problem (Q6050615) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- On a wider class of prior distributions for graphical models (Q6198974) (← links)
