1736 search results - page 56 / 348 » The rank-width of Directed Graphs |
115
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
160
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
168
click to vote
JMLR
2008
15 years 3 months ago
2008
In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi...
143
click to vote
DSS
2002
15 years 3 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
149
Voted
JUCS
2002
15 years 3 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...