Sciweavers

557 search results - page 60 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
MP
1998
117views more  MP 1998»
14 years 10 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
PODC
2005
ACM
15 years 4 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
ISVD
2007
IEEE
15 years 5 months ago
Apollonius diagrams and the Representation of Sounds and Music
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...
Alex McLean, Frederic F. Leymarie, Geraint A. Wigg...
88
Voted
APVIS
2008
15 years 18 days ago
Interactive Visual Analysis of the NSF Funding Information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon the treemap...
Shixia Liu, Nan Cao, Hao Lv
JDA
2006
83views more  JDA 2006»
14 years 11 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki