1736 search results - page 54 / 348 » The rank-width of Directed Graphs |
135
click to vote
SIROCCO
2001
15 years 5 months ago
2001
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
116
Voted
CCCG
2010
15 years 5 months ago
2010
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
143
Voted
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
151
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
128
click to vote
DAM
2006
15 years 4 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...