Demo Data from EDBT 2026 / reviewers in the wild / expert
Philippe G. H. Lehot
dblp:22/6025
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 67% Algorithms and data structures · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
graph algorithms |
0.0 | 1 | 1974 | An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph · J. ACM 1974 |
Graph algorithms and graph theory › graph classes
graph recognition |
0.0 | 1 | 1974 | An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph · J. ACM 1974 |
Algorithms and data structures › parallel algorithms
time-optimal algorithms |
0.0 | 1 | 1974 | An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph · J. ACM 1974 |
Methods — techniques the papers use, named apart from their topics
root graph construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | An Optimal Algorithm to Detect a Line Graph and Output Its Root GraphabstractGiven a graph H with E edges and N nodes, a graph G is sought such that H is the line graph of G , if G exists. The algorithm does this within the order of E steps, in fact in E + O ( N ) steps. This algorithm is optimal in its complexity. Philippe G. H. Lehot |
J. ACM | 1 |