1736 search results - page 47 / 348 » The rank-width of Directed Graphs |
128
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
104
Voted
ESA
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
139
Voted
IPL
2010
15 years 2 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
145
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
112
Voted
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
The number of publications in biomedicine is increasing enormously each year. To help researchers digest the information in these documents, text mining tools are being developed ...