557 search results - page 58 / 112 » Visualizing Weighted Edges in Graphs |
136
click to vote
MP
2006
15 years 3 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
125
click to vote
APVIS
2006
15 years 4 months ago
2006
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
123
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
141
click to vote
MSE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper we describe an authoring environment which allows the author to set up and test a complex multimedia presentation by defining the synchronization relationships amon...
160
Voted
CLIMA
2004
15 years 4 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...