The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Edge Dominating Sets in Graphs
Abstract
We prove that the edge dominating set problem for graphs is $NP$-complete even when restricted to planar or bipartite graphs of maximum degree 3. We show as a corollary that the minimum maximal matching and the achromatic number problems are $NP$-complete. A new linear time algorithm for finding minimum independent edge dominating sets in trees is described, based on an observed relationship between edge dominating sets and independent sets in total graphs.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Harary, F. (1969) · Cited by 10,739
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
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Dirac, G. A. (1961) · Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg · doi:10.1007/bf02992776 · Cited by 927
Introduction to Combinatorial Mathematics.
Moon, J. W., Dantzig, G., & Liu, C. L. (1971) · The American Mathematical Monthly · doi:10.2307/2317652 · Cited by 606
INTRODUCTION TO COMBINATORIAL MATHEMATICS
Williamson, S. G. (1969) · Bulletin of the London Mathematical Society · doi:10.1112/blms/1.3.431 · Cited by 444
Yannakakis, M. (1981) · SIAM Journal on Computing · doi:10.1137/0210021 · Cited by 203
Self-citation
Cited by
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
Hard variants of stable marriage
Manlove, D. F., Irving, R. W., Iwama, K., Miyazaki, S., & Morita, Y. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00206-7 · Cited by 311
Metadata
- Authors
- Yannakakis, M., & Gavril, F.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1980-06
- Volume
- 38
- Issue
- 3
- Pages
- 364-372
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W1988133548
- Cited by
- 394
- References
- 8
- FWCI
- 0.56
- 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.