Pages that link to "Item:Q1327235"
From MaRDI portal
The following pages link to Some complexity results about threshold graphs (Q1327235):
Displaying 18 items.
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Complexity of min-max subsequence problems (Q1014423) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- The simple graph threshold number \(\sigma(r,s,a,t)\) when \(r\geq 3\) is odd and \(a\geq 2\) is even (Q2799795) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
- (Q3635359) (← links)
- Enumerating threshold graphs and some related graph classes (Q5080334) (← links)
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826) (← links)
- (Q5708487) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- Min-max subsequence problems in multi-zone disk recording (Q5952432) (← links)
- Some Properties of Chain and Threshold Graphs (Q6053094) (← links)