Sciweavers

2 search results - page 1 / 1
» The 2-dimensional rigidity of certain families of graphs
Sort
View
JGT
2007
112views more  JGT 2007»
13 years 4 months ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 2 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno