Sciweavers

3204 search results - page 105 / 641
» The Alcuin Number of a Graph
Sort
View
SOFSEM
2007
Springer
14 years 2 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
ACSAC
2005
IEEE
14 years 1 months ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia
JGT
2010
90views more  JGT 2010»
13 years 6 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
IPPS
2007
IEEE
14 years 2 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
14 years 2 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean