1736 search results - page 76 / 348 » The rank-width of Directed Graphs |
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
124
click to vote
SIAMCO
2008
15 years 4 months ago
2008
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
151
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
146
click to vote
ICMCS
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we present a system for exhibiting a Chinese landscape painting about 900 years old. There are three parts in our system: (1) we allocate a voice dubbing or backgro...