Jun-Lin Guo

most citedA linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2013

Set Representations of Linegraphs

Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang +1

Let $G$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . A family $S$ of nonempty sets ${S_{1}, \dots, S_{n}}$ is a set representation of $G$ if there exists a one-to-…

math.GR2013

The Domination Number of Generalized Petersen Graphs with a Faulty Vertex

Jun-Lin Guo, Kuo-Hua Wu, Yue-Li Wang +1

In this paper, we investigate the domination number of generalized Petersen graphs P(n, 2) when there is a faulty vertex. Denote by $γ (P (n, 2))$ the domination number of P(n,2) and…

cs.DS2012★ 1 cited

A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths

Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang

For two vertices $s$ and $t$ in a graph $G = (V, E)$ , the next-to-shortest path is an $s t$ -path which length is minimum amongst all $s t$ -paths strictly longer than the shortest path l…