1736 search results - page 109 / 348 » The rank-width of Directed Graphs |
153
click to vote
JCT
2008
15 years 4 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
124
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
181
click to vote
WMCSA
2002
IEEE
15 years 9 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
142
Voted
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present the integration of graph-based visual perception to spoken conversation in human-robot interaction. The proposed architecture has a dialogue manager as the...
139
click to vote
JCO
2007
15 years 4 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...