1736 search results - page 15 / 348 » The rank-width of Directed Graphs |
144
click to vote
ISCAPDCS
2003
15 years 7 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
155
click to vote
DM
2010
15 years 5 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...
157
click to vote
SCN
2008
Springer
15 years 5 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
146
click to vote
GBRPR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
