Sciweavers

28 search results - page 6 / 6
» On co-distance hereditary graphs
Sort
View
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 3 months ago
A Simple Linear Time LexBFS Cograph Recognition Algorithm
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...
Anna Bretscher, Derek G. Corneil, Michel Habib, Ch...
JAL
1998
85views more  JAL 1998»
13 years 4 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 2 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...