15 search results - page 1 / 3 » A Simple Linear Time LexBFS Cograph Recognition Algorithm |
SIAMDM
2008
13 years 3 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
WG
2007
Springer
13 years 11 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
COLOGNETWENTE
2009
13 years 6 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...