656 search results - page 60 / 132 » Graph Theoretical Characterization and Computation of Answer... |
133
click to vote
COMBINATORICS
2007
15 years 4 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
166
click to vote
EJC
2011
14 years 11 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
147
Voted
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
118
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome [9], [15] for such a game is an equilibrium concept that combine...
126
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, after a new DNA-based semantic model is theoretically proposed, the preliminary experiment on construction of the small test model is successfully done. This model, ...