4171 search results - page 211 / 835 » Choice numbers of graphs |
156
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
154
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
210
Voted
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
173
click to vote
ROBOCUP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
188
click to vote
IWPC
2000
IEEE
15 years 11 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...