335 search results - page 40 / 67 » How to Use Spanning Trees to Navigate in Graphs |
201
click to vote
ASIAMS
2007
IEEE
16 years 15 days ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
162
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
128
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, w...
167
click to vote
ASSETS
2008
ACM
15 years 8 months ago
2008
ACM
Existing knowledge on how people use speech-based technologies in realistic settings is limited. We are conducting a longitudinal field study, spanning six months, to investigate ...