1736 search results - page 84 / 348 » The rank-width of Directed Graphs |
142
click to vote
GC
2008
Springer
15 years 4 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
125
Voted
WCRE
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a suite of small tools, implemented as a pipeline of text file manipulating scripts, that, on one hand, measure the evolution of any software structure that can be rep...
119
click to vote
EMNLP
2006
15 years 5 months ago
2006
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
139
click to vote
MP
2007
15 years 3 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
141
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...