103 search results - page 15 / 21 » A New Upper Bound on the Total Domination Number of a Graph |
ESA
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
JEC
2006
13 years 7 months ago
2006
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
SIROCCO
2007
13 years 8 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
ECCC
2010
13 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...