The DOI matches its Crossref record.
The Theory of Graphs and Its Applications
Abstract
This book on the theory of graphs provides the reader with a mathematical tool which can be used in the behavioral sciences, in the theory of information, cybernetics, games, transport networks, as well as in set theory and matrix theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Akers (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675141 · Cited by 1,828
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 664
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
The complexity and robustness of metro networks
Derrible, S., & Kennedy, C. (2010) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.04.008 · Cited by 438
Speech discrimination by dynamic programming
Vintsyuk, T. K. (1972) · Cybernetics · doi:10.1007/bf01074755 · Cited by 431
Network thermodynamics: dynamic modelling of biophysical systems
Oster, G. F., Perelson, A. S., & Katchalsky, A. (1973) · Quarterly Reviews of Biophysics · doi:10.1017/s0033583500000081 · Cited by 337
Niem�ller, K., & Schijf, B. (1980) · Quality and Quantity · doi:10.1007/bf00154795 · Cited by 309
An O (N2.5) algorithm for maximum matching in general graphs
Even, S., & Kariv, O. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.5 · Cited by 287
Emergent properties in random complex automata
Kauffman, S. A. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90257-4 · Cited by 253
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
A linear time implementation of the reverse Cuthill-McKee algorithm
Chan, W. M., & George, A. (1980) · BIT Numerical Mathematics · doi:10.1007/bf01933580 · Cited by 80
Metadata
- Authors
- Burger, E., Berge, C., & Doig, A.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1965-01
- Volume
- 33
- Issue
- 1
- Pages
- 251
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W1999667176
- Cited by
- 897
- References
- 0
- FWCI
- 31.03
- 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.