Sciweavers

316 search results - page 18 / 64
» On almost self-complementary graphs
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 26 days ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
VRST
1999
ACM
14 years 1 months ago
Distributed Open Inventor: a practical approach to distributed 3D graphics
Distributed Open Inventor is an extension to the popular Open Inventor toolkit for interactive 3D graphics. The toolkit is extended with the concept of a distributed shared scene ...
Gerd Hesina, Dieter Schmalstieg, Anton L. Fuhrmann...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 6 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
FOCS
2005
IEEE
14 years 2 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
AGTIVE
2003
Springer
14 years 1 months ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl