1538 search results - page 176 / 308 » Spectral Techniques in Graph Algorithms |
147
click to vote
TVCG
2008
15 years 3 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
168
click to vote
ISSTA
2012
ACM
13 years 6 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...
136
click to vote
NJC
2000
15 years 3 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
131
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
120
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...