2463 search results - page 124 / 493 » Rankings of Directed Graphs |
229
click to vote
DISOPT
2011
14 years 10 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
155
Voted
TIT
2010
14 years 10 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
170
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
141
Voted
BMCBI
2004
15 years 3 months ago
2004
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
132
click to vote
COCOON
2001
Springer
15 years 7 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...