4 search results - page 1 / 1 » A Simple Linear-Time Recognition Algorithm for Weakly Quasi-... |
COLOGNETWENTE
2009
13 years 5 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...
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...
ISAAC
1992
Springer
13 years 8 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...