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...

DM

1999

13 years 5 months ago
1999

A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...

CORR

2006

Springer

13 years 5 months ago
2006

Springer

We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...

SWAT

2004

Springer

13 years 10 months ago
2004

Springer

The ﬁrst polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...

WG

2005

Springer

13 years 11 months ago
2005

Springer

Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...