Sciweavers

2283 search results - page 184 / 457
» Bounds of Graph Characteristics
Sort
View
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 10 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
WISE
2000
Springer
14 years 19 days ago
Visualization of Web-based Workspace Structures
Web-based collaboration is becoming increasingly common. Often such collaboration exhibits emergent characteristics, for which systems based on a notion of workspaces provide suit...
Robert P. Biuk-Aghai
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
MFCS
2007
Springer
14 years 2 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
14 years 9 days ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein