Pages that link to "Item:Q1001894"
From MaRDI portal
The following pages link to Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894):
Displaying 9 items.
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs (Q2803835) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
