Evidence map›Paper›PMID 40352583›Full record

ArticleAlgorithmica2025

Counting Temporal Paths.

Jessica Enright, Kitty Meeks, Hendrik Molter

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Algorithmica, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Jessica EnrightSchool of Computing Science, University of Glasgow, Glasgow, UK.
Kitty MeeksSchool of Computing Science, University of Glasgow, Glasgow, UK.
Hendrik MolterDepartment of Computer Science and Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Be'er Sheva, Israel.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This work investigates the parameterised complexity of counting temporal paths. The problem of counting temporal paths is mainly motivated by temporal betweenness computation. The betweenness centrality of a vertex

Indexed as

Approximate countingParameterised counting#P-hard counting problemsTemporal betweenness centralityTemporal graphsTemporal paths

Identifiers

PMID40352583
PMCPMC12062201

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.