Sciweavers

966 search results - page 15 / 194
» Small Alliances in Graphs
Sort
View
COCOON
2006
Springer
14 years 9 days ago
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
Jesper Torp Kristensen, Peter Bro Miltersen
FCS
2009
13 years 6 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
SIAMCOMP
2011
13 years 3 months ago
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Avraham Ben-Aroya, Amnon Ta-Shma
WWW
2006
ACM
14 years 9 months ago
Site level noise removal for search engines
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...
André Luiz da Costa Carvalho, Paul-Alexandr...
SRDS
2003
IEEE
14 years 1 months ago
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network giv...
Yang Wang 0008, Deepayan Chakrabarti, Chenxi Wang,...