1461 search results - page 271 / 293 » Complexity of Graph Covering Problems |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
CSL
2004
Springer
14 years 28 days ago
2004
Springer
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
SIGECOM
2003
ACM
14 years 23 days ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
CHI
1996
ACM
13 years 11 months ago
1996
ACM
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...