Sciweavers

2463 search results - page 240 / 493
» Rankings of Directed Graphs
Sort
View
SIROCCO
2007
15 years 5 months ago
Rapid Almost-Complete Broadcasting in Faulty Networks
This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other verti...
Rastislav Kralovic, Richard Královic
IJCAI
2001
15 years 5 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
110
Voted
APVIS
2009
15 years 5 months ago
Extending the spring-electrical model to overcome warping effects
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
Yifan Hu, Yehuda Koren
CORR
2006
Springer
164views Education» more  CORR 2006»
15 years 3 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
153
Voted
JCT
2006
110views more  JCT 2006»
15 years 3 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený