2463 search results - page 265 / 493 » Rankings of Directed Graphs |
173
click to vote
MFCS
2004
Springer
16 years 21 hour ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
150
Voted
ICNP
2000
IEEE
15 years 11 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
168
click to vote
ER
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
172
click to vote
EUROCOLT
1995
Springer
15 years 10 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
141
click to vote
ICSE
1995
IEEE-ACM
15 years 10 months ago
1995
IEEE-ACM
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...