Sciweavers

2463 search results - page 264 / 493
» Rankings of Directed Graphs
Sort
View
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 4 months ago
A fast algorithm for computing steiner edge connectivity
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 ...
Richard Cole, Ramesh Hariharan
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
15 years 10 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
102
Voted
CIBCB
2007
IEEE
15 years 10 months ago
Spectral Decomposition of Signaling Networks
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
Bahram Parvin, Nirmalya Ghosh, Laura Heiser, Merri...
134
Voted
ISMAR
2006
IEEE
15 years 9 months ago
Interactive context-driven visualization tools for augmented reality
In this article we present an interaction tool, based on the Magic Lenses technique, that allows a 3D scene to be affected dynamically given contextual information, for example, t...
Erick Méndez, Denis Kalkofen, Dieter Schmal...
140
Voted
SAC
2005
ACM
15 years 9 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq