Some complexity results about threshold graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- Cyclic scheduling of offweekends
- Hamiltonian threshold graphs
- Sufficient Conditions for Graphs to Have Threshold Number 2
- The Complexity of the Partial Order Dimension Problem
- Threshold Numbers and Threshold Completions
- Threshold hypergraphs
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(18)- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Complexity of min-max subsequence problems
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Complexity classification of some edge modification problems
- On dynamic threshold graphs and related classes
- Some Properties of Chain and Threshold Graphs
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- NP-completeness results for edge modification problems
- Enumerating threshold graphs and some related graph classes
- Min-max subsequence problems in multi-zone disk recording
- A sharp threshold phenomenon in string graphs
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- scientific article; zbMATH DE number 5575414 (Why is no real title available?)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- The simple graph threshold number \(\sigma(r,s,a,t)\) when \(r\geq 3\) is odd and \(a\geq 2\) is even
This page was built for publication: Some complexity results about threshold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327235)
