5606 search results - page 146 / 1122 » Randomization Techniques for Graphs. |
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
RANDOM
2001
Springer
14 years 3 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
IV
2010
IEEE
13 years 9 months ago
2010
IEEE
There have been two types of Web visualization techniques: visualization of Web sites themselves based on such as link structures or lexical contents, and visualization of browser...
ICCD
2008
IEEE
14 years 7 months ago
2008
IEEE
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
GD
2005
Springer
14 years 4 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...