Sciweavers

36781 search results - page 6 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
MOC
2002
103views more  MOC 2002»
13 years 7 months ago
Computation of class numbers of quadratic number fields
We explain how one can dispense with the numerical computation of approximations to the transcendental integral functions involved when computing class numbers of quadratic number ...
Stéphane Louboutin
DCG
2008
93views more  DCG 2008»
13 years 7 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
DM
2000
158views more  DM 2000»
13 years 7 months ago
Bipartite Ramsey numbers and Zarankiewicz numbers
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...
CMA
2011
12 years 11 months ago
On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. The domination number γ of Fibonacci cubes and Lucas cubes is studied. In particular it is prove...
Aline Castro, Sandi Klavzar, Michel Mollard, Yoomi...