Sciweavers

557 search results - page 13 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
IPL
2006
115views more  IPL 2006»
14 years 11 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
AUIC
2003
IEEE
15 years 4 months ago
Keg Master: a Graph-Aware Visual Editor for 3D Graphs
This paper presents Keg Master, a graph-aware visual editor for 3D graphs. Keg Master is novel in that it works with a graph description language as opposed to a scene graph descr...
Hannah Slay, Matthew Phillips, Bruce H. Thomas, Ru...
IUI
2004
ACM
15 years 4 months ago
Evaluation of visual balance for automated layout
Layout refers to the process of determining the size and position of the visual objects in an information presentation. We introduce the WeightMap, a bitmap representation of the ...
Simon Lok, Steven Feiner, Gary Ngai
APPROX
2008
Springer
137views Algorithms» more  APPROX 2008»
15 years 24 days ago
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Zeev Nutov
DM
2010
115views more  DM 2010»
14 years 11 months ago
Edge colouring by total labellings
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
Stephan Brandt, Kristína Budajová, D...