Author pages are created from data sourced from our academic publisher partnerships and public sources.
Approximating the spanning star forest problem and its applications to genomic sequence alignment
- C. T. Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, L. Zhang
- Mathematics, Computer Science
- SODA '07
- 7 January 2007
This paper studies the algorithmic issues of the spanning star forest problem. Expand
2-Role assignments on triangulated graphs
- Li Sheng
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 28 July 2003
We study 2-role assignments for triangulated graphs with at most one pendant vertex. Expand
How hard is it to determine if a graph has a 2-role assignment?
We investigate in this paper the computational complexity of the problem of determining if a graph has a 2-role assignment with two different roles. Expand
A characterization of cycle-free unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals overlap and at least one of them is a Probe. Expand
Tagged Probe Interval Graphs
A generalization of interval graph is introduced for cosmid contig mapping of DNA. Expand
How hard is it to determine if a graph has a 2‐role assignment?
Role assignments, introduced by Everett and Borgatti , who called them role colorings, formalize the idea, arising In the theory of social networks, that individuals of the same social role will… Expand
The Expected Size of the Rule k Dominating Set
In this paper we consider the "average-case" performance of two closely related versions of Rule k for the model of random unit disk graphs constructed from n random points in an $\ell_n\times \ell_N$ square. Expand
Phylogeny graphs of arbitrary digraphs
Phylogeny numbers for graphs with two triangles
We obtain results about phylogeny number for graphs with exactly two triangles analogous to those for competition number. Expand
Covering random points in a unit disk
Let D be the punctured unit disk. It is easy to see that no pair x, y in D can cover D in the sense that D cannot be contained in the union of the unit disks centred at x and y. With this fact in… Expand