We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...