The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Edge-Deletion Problems
Abstract
If $\pi $ is a property on graphs or digraphs, the edge-deletion problem can be stated as follows: find the minimum number of edges whose deletion results in a subgraph (or subdigraph) satisfying property $\pi $. Several well-studied graph problems can be formulated as edge-deletion problems. In this paper we show that the edge-deletion problem is NP-complete for the following properties: (1) without cycles of specified length l, or of any length $ \leqq l$, (2) connected and degree-constrained, (3) outerplanar, (4) transitive digraph, (5) line-invertible, (6) bipartite, (7) transitively orientable. For problems (5), (6), (7) we determine the best possible bounds on the node-degrees for which the problems remain NP-complete.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Cited by
The node-deletion problem for hereditary properties is NP-complete
Lewis, J. M., & Yannakakis, M. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90060-4 · Cited by 513
Self-citationEdge Dominating Sets in Graphs
Yannakakis, M., & Gavril, F. (1980) · SIAM Journal on Applied Mathematics · doi:10.1137/0138030 · Cited by 394
Self-citationApproximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Garg, N., Vazirani, V. V., & Yannakakis, M. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793243016 · Cited by 335
Self-citation
Metadata
- Authors
- Yannakakis, M.
- Venue
- SIAM Journal on Computing
- Published
- 1981-05
- Volume
- 10
- Issue
- 2
- Pages
- 297-309
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2059401572
- Cited by
- 203
- References
- 2
- FWCI
- 1.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.