Sciweavers

5473 search results - page 717 / 1095
» On the graph isomorphism problem
Sort
View
182
Voted
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 7 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
184
Voted
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 4 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
16 years 1 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura
FOCS
2009
IEEE
16 years 1 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer