Sciweavers

352 search results - page 64 / 71
» Partitioning Graphs into Connected Parts
Sort
View
CIKM
2007
Springer
15 years 5 months ago
A dual-view approach to interactive network visualization
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 25 days ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
ERCIMDL
2009
Springer
225views Education» more  ERCIMDL 2009»
15 years 6 months ago
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D
Abstract. The PROBADO project is a research effort to develop Digital Library support for non-textual documents. The main goal is to contribute to all parts of the Digital Library...
René Bernd, Ina Blümel, Harald Krottma...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 5 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
IMC
2009
ACM
15 years 6 months ago
Characterizing user behavior in online social networks
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...
Fabrício Benevenuto, Tiago Rodrigues, Meeyo...