Sciweavers

205 search results - page 4 / 41
» Pruning 2-Connected Graphs
Sort
View
DM
2000
99views more  DM 2000»
13 years 7 months ago
Chromatically unique bipartite graphs with low 3-independent partition numbers
For integers p; q; s with p
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
CIC
2004
107views Communications» more  CIC 2004»
13 years 8 months ago
Hexagonal and Pruned Torus Networks as Cayley Graphs
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
Wenjun Xiao, Behrooz Parhami
GEM
2007
13 years 8 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...
PAKDD
2007
ACM
166views Data Mining» more  PAKDD 2007»
14 years 1 months ago
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu