Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Sheung-Hung Poon
A Simple Algorithm for Finding All K-Edge-Connected Components
PLoS ONE
Multidisciplinary
Related publications
A Simple, Pipelined Algorithm for Large, Irregular All-Gather Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Simple Linear Algorithm for the Connected Domination Problem in Circular-Arc Graphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
The Algorithm of Finding of K Maximum Flows
SPIIRAS Proceedings
Control
Systems Engineering
Information Systems
Computer Networks
Applied Mathematics
Mathematics
Communications
Computer Science Applications
Computational Theory
Computational Mathematics
Artificial Intelligence
Existence of K-Edge Connected Ordinary Graphs With Prescribed Degrees
Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics
Algorithms for Generating All Possible Spanning Trees of a Simple Undirected Connected Graph: An Extensive Review
Complex & Intelligent Systems
A Class of Spaces Containing All Connected and All Locally Connected Spaces
Mathematische Nachrichten
Mathematics
Generating Connected and 2-Edge Connected Graphs
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
A Simple Density With Distance Based Initial Seed Selection Technique for K Means Algorithm
Journal of Computing and Information Technology
Computer Science
A 4 + Ε Approximation for K-Connected Subgraphs