1736 search results - page 85 / 348 » The rank-width of Directed Graphs |
141
click to vote
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
134
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
114
click to vote
FORTE
1998
15 years 5 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
139
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
137
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...