1736 search results - page 14 / 348 » The rank-width of Directed Graphs |
ALGORITHMICA
2000
14 years 10 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
102
click to vote
NIPS
2004
14 years 11 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...