The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Separator Theorem for Planar Graphs
Abstract
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than ${2n / 3}$ vertices, and C contains no more than $2\sqrt 2 \sqrt n $ vertices. We exhibit an algorithm which finds such a partition A, B, C in $O( n )$ time.
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
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Hopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Self-citationNested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Sur le problème des courbes gauches en Topologie
Kuratowski, C. (1930) · Fundamenta Mathematicae · doi:10.4064/fm-15-1-271-283 · Cited by 1,025
Algorithm 447: efficient algorithms for graph manipulation
Hopcroft, J., & Tarjan, R. (1973) · Communications of the ACM · doi:10.1145/362248.362272 · Cited by 985
Self-citationHopcroft, J., Paul, W., & Valiant, L. (1977) · Journal of the ACM · doi:10.1145/322003.322015 · Cited by 253
Multidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Self-citationSpace bounds for a game on graphs
Paul, W. J., Tarjan, R. E., & Celoni, J. R. (1976) · Theory of Computing Systems · doi:10.1007/bf01683275 · Cited by 126
Self-citationOn sparse graphs with dense long paths
Erdős, P., Graham, R. L., & Szemerédi, E. (1975) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(75)90037-1 · Cited by 85
Tape bounds for time-bounded turing machines
Paterson, M. S. (1972) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(72)80017-5 · Cited by 47
Cited by
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922
Metadata
- Authors
- Lipton, R. J., & Tarjan, R. E.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1979-04
- Volume
- 36
- Issue
- 2
- Pages
- 177-189
- ISSN
- 0036-1399 (ISSN-L)
- 1095-712X
- OpenAlex
- W2038643780
- Cited by
- 1,359
- References
- 11
- FWCI
- 13.43
- 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.