216 search results - page 9 / 44 » Edge Search Number of Cographs in Linear Time |
STOC
2010
ACM
13 years 12 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
ALGORITHMICA
2002
13 years 7 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
VLDB
2006
ACM
14 years 7 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
ATAL
2009
Springer
13 years 5 months ago
2009
Springer
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...