Y. Daniel Liang

Available identifiers

zbMath Open liang.y-danielMaRDI QIDQ1209982

List of research outcomes

Publication	Date of Publication	Type
Dominations in trapezoid graphs	2000-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4387703	1998-10-19	Paper
Parallel algorithms for the domination problems in trapezoid graphs	1997-11-25	Paper
Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs	1997-06-19	Paper
Finding biconnected components in O(n) time for a class of graphs	1997-02-27	Paper
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits	1997-02-27	Paper
An NC algorithm for the clique cover problem in cocomparability graphs and its application	1997-02-27	Paper
An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph	1996-11-10	Paper
Finding a maximum matching in a permutation graph	1995-11-20	Paper
On the feedback vertex set problem in permutation graphs	1995-10-09	Paper
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs	1994-01-01	Paper
Finding a maximum matching in a circular-arc graph	1993-05-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Y. Daniel Liang