Sciweavers

1172 search results - page 113 / 235
» Path Algorithms on Regular Graphs
Sort
View
81
Voted
DEXA
2003
Springer
113views Database» more  DEXA 2003»
15 years 5 months ago
Termination Analysis of Active Rules with Priorities
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
Alain Couchot
94
Voted
ORL
2008
99views more  ORL 2008»
15 years 15 days ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
107
Voted
CCR
1998
96views more  CCR 1998»
15 years 8 days ago
On routes and multicast trees in the Internet
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
Jean-Jacques Pansiot, Dominique Grad
100
Voted
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
89
Voted
CAE
2007
15 years 3 months ago
Stipple Placement using Distance in a Weighted Graph
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
David Mould