343 search results - page 62 / 69 » On Making Directed Graphs Transitive |
123
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
NHM
2010
14 years 6 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
FEDCSIS
2011
13 years 11 months ago
2011
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
114
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
96
Voted
ICHIM
2001
15 years 1 months ago
2001
The "Institut National de I'Audiovisuel" (1NA) is in charge of keeping records of national TV broadcasts. Its main function is to provide TV producers with authenti...