1545 search results - page 191 / 309 » On tree congestion of graphs |
AIPS
2000
14 years 11 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
SODA
1990
ACM
14 years 11 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
CONSTRAINTS
2010
14 years 10 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
JDA
2008
14 years 10 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...