Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Tsin, Yung H."'
Autor:
Tsin, Yung H.
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contraction operation and makes only one pass over the graph. By contrast, t
Externí odkaz:
http://arxiv.org/abs/2309.13827
Autor:
Tsin, Yung H.
Given a connected undirected multigraph G (a graph that may contain parallel edges), the algorithm of [19] finds the 3-edge-connected components of $G$ in linear time using an innovative graph contraction technique based on a depth-first search. In [
Externí odkaz:
http://arxiv.org/abs/2306.14103
Autor:
Tsin, Yung H.
A linear-time certifying algorithm for 3-edge-connectivity is presented. Given an undirected graph G, if G is 3-edge-connected, the algorithm generates a construction sequence as a positive certificate for G. Otherwise, the algorithm decomposes G int
Externí odkaz:
http://arxiv.org/abs/2002.04727
Publikováno v:
In Discrete Applied Mathematics 30 January 2023 325:152-171
Autor:
Zhang, Yong, Chin, Francis Y.L., Ting, Hing-Fung, Han, Xin, Poon, Chung Keung, Tsin, Yung H., Ye, Deshi
Publikováno v:
In Theoretical Computer Science 16 October 2014 554:135-149
Autor:
Tsin, Yung H.1 peter@cs.uwindsor.ca
Publikováno v:
Theory of Computing Systems. Feb2007, Vol. 40 Issue 2, p125-142. 18p. 5 Diagrams.
Autor:
Norouzi, Nima, Tsin, Yung H.
Publikováno v:
In Information Processing Letters January-February 2014 114(1-2):50-55
Publikováno v:
In Information Processing Letters 2011 111(16):773-779