3268 search results - page 184 / 654 » The hub number of a graph |
153
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...
203
click to vote
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...
172
click to vote
ROBOCUP
2005
Springer
16 years 15 hour 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...
184
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...
151
click to vote
CASES
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...