CoChat

The electrical resistance of a graph captures its commute and cover times

The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/bf01270385

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 30 references

Cited by

Items 101–200 of 316

Metadata

Authors
Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., & Tiwari, P.
Affiliations
  • IBM Research - Almaden (US)
  • University of Washington (US)
  • IBM (United States) (US)
Corresponding author
  • Chandra, Ashok K.
  • Raghavan, Prabhakar
  • Ruzzo, Walter L.
  • Tiwari, Prasoon
Venue
Computational Complexity
Published
1996-12
Volume
6
Issue
4
Pages
312-340
ISSN
  • 1016-3328 (ISSN-L)
  • 1420-8954
OpenAlex
W2048572907
Cited by
328
References
30
Citations by year
2026: 8 · 2025: 9 · 2024: 15 · 2023: 17 · 2022: 27 · 2021: 21 · 2020: 19 · 2019: 20 · 2018: 24 · 2017: 25 · 2016: 10 · 2015: 16 · 2014: 16 · 2013: 18 · 2012: 15
FWCI
1.54
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Computational Complexity (publishedVersion)
Funders
National Science Foundation
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
Keywords
graph resistance, effective resistance, commuting time, cover time, random walks, electrical networks, expander graphs

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.