G. Pampoukis

dblp:45/1639 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

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 · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › network analysis › network reliability
k-terminal reliability
0.011996
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" · SIAM J. Comput. 1996
Graph algorithms and graph theory › network analysis
network reliability
0.011996
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" · SIAM J. Comput. 1996
Graph algorithms and graph theory › graph classes › sparse graphs
series-parallel graphs
0.011996
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" · SIAM J. Comput. 1996

Methods — techniques the papers use, named apart from their topics

reliability-preserving reductions · 0.0
YearPublicationVenuePosition
1996 Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network"
abstract
In an original and very interesting paper (Satyanarayana and Wood [1]) concerning polygon-to-chain reductions in a stochastic network, a small inconsistency occurs in the proof of Theorem 1. In particular, this happens in cases where the whole set of ${\bf K}$-vertices lies in the remaining polygon. Such an example is the case of polygon type 5, where the appropriate note has been made by the authors for $|{\bf K}| = 2$. Analogous notes must also be made for polygon types 4, 6, and 7, when ${\bf K} = 2,3$, and 4, respectively. The correct transformations are given in Table 1 (note that dark vertices are ${\bf K}$-vertices).
Appajosyula Satyanarayana, R. Kevin Wood, Leonidas Camarinopoulos, G. Pampoukis
SIAM J. Comput.4