776 search results - page 4 / 156 » Network Applications of Graph Bisimulation |
157
Voted
ICDAR
2011
IEEE
14 years 2 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
119
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
131
Voted
IPL
2011
14 years 9 months ago
2011
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
155
Voted
ISSTA
2012
ACM
13 years 5 months ago
2012
ACM
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
116
click to vote
CHI
2010
ACM
15 years 9 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...