Author Info
Name
Affiliation
Papers
Y. DANIEL LIANG
Armstrong Atlantic State University, Savannah, GA
21
Collaborators
Citations 
PageRank 
12
153
14.93
Referers 
Referees 
References 
216
92
97
Search Limit
100216
Title
Citations
PageRank
Year
Undergraduate computer graphics using Java 3D10.402005
Effincient Domination of Permutation Graphs and Trapezoid Graphs181.241997
Parallel algorithms for the domination problems in trapezoid graphs10.401997
Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite Graphs191.201997
An NC algorithm for the clique cover problem in cocomparability graphs and its application10.401996
An O(N+M)-Time Algorithm For Finding A Minimum-Weight Dominating Set In A Permutation Graph30.511996
Finding biconnected components in O(n) time for a class of graphs40.681996
Steiner set and connected domination in trapezoid graphs130.821995
Circular convex bipartite graphs: maximum matching and Hamiltonian circuits130.841995
Teaching dynamic programming techniques using permutation graphs10.411995
An optimal algorithm for finding biconnected components in permutation graphs30.411995
Finding a Maximum Matching in a Permutation Graph.10.401995
On the feedback vertex set problem in permutation graphs282.171994
Linear algorithms for two independent set problems in permutation graphs20.531994
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs131.211994
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)00.341994
Dominations in trapezoid graphs140.951994
Finding a maximum matching in a circular-arc graph90.641993
An O(n log n) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.30.391993
An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs20.381993
Parallel algorithms for ranking of trees40.641990