1736 search results - page 7 / 348 » The rank-width of Directed Graphs |
CORR
2009
Springer
14 years 8 months ago
2009
Springer
CPC
2010
14 years 7 months ago
2010
SIAMDM
2000
14 years 9 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
162
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...